Sequoia
|
Underlying class for the various different graph flavour. More...
#include "sequoia/Algorithms/Algorithms.hpp"
#include "sequoia/Maths/Graph/Connectivity.hpp"
#include "sequoia/Maths/Graph/GraphTraits.hpp"
#include "sequoia/Core/ContainerUtilities/AssignmentUtilities.hpp"
Go to the source code of this file.
Typedefs | |
template<network Connectivity, class Nodes > | |
using | sequoia::maths::graph_impl::pseudo_iterator = utilities::iterator< typename graph_primitive< Connectivity, Nodes >::edge_index_type, graph_dereference_policy< Connectivity, Nodes > > |
using | sequoia::maths::symmetric_tree_type = tree_link_direction_constant< tree_link_direction::symmetric > |
using | sequoia::maths::forward_tree_type = tree_link_direction_constant< tree_link_direction::forward > |
using | sequoia::maths::backward_tree_type = tree_link_direction_constant< tree_link_direction::backward > |
Enumerations | |
enum class | tree_link_direction { symmetric , forward , backward } |
Variables | |
template<network Connectivity, class Nodes > | |
class SEQUOIA_MSVC_EMPTY_BASE_HACK | sequoia::maths::graph_primitive |
Underlying class for the various different graph flavour.
using sequoia::maths::graph_impl::pseudo_iterator = typedef utilities::iterator<typename graph_primitive<Connectivity, Nodes>::edge_index_type, graph_dereference_policy<Connectivity, Nodes> > |
Designed to swap nodes, when used in conjunction with sequoia::swap, courtesy of the overload of iter_swap, below. This is a pseudo iterator since it doesn't have reference semantics