Connectivity.hpp File Reference

Implementation for a partitioned sequence of edges, which represents a graph's connectivity. More...

#include "sequoia/Core/DataStructures/DataStructuresTypeTraits.hpp"
#include "sequoia/Maths/Graph/GraphDetails.hpp"
#include "sequoia/Maths/Graph/GraphErrors.hpp"
#include "sequoia/Maths/Graph/GraphTraits.hpp"
#include "sequoia/Algorithms/Algorithms.hpp"
#include "sequoia/Core/Meta/TypeTraits.hpp"
#include "sequoia/Core/ContainerUtilities/AssignmentUtilities.hpp"
#include "sequoia/Core/Object/HandlerTraits.hpp"
#include "sequoia/PlatformSpecific/Preprocessor.hpp"
#include <limits>
#include <stdexcept>
#include <ranges>

Go to the source code of this file.

Classes
class	sequoia::maths::graph_impl::edge_maker< EdgeType, EdgeStorageType >
class	sequoia::maths::graph_impl::weight_sentinel< Iter >
class	sequoia::maths::graph_impl::join_sentinel< Edges >
struct	sequoia::maths::graph_impl::edge_comparer
struct	sequoia::maths::partitions_allocator_tag
class	sequoia::maths::connectivity_base< Flavour, EdgeStorage >
	Graph connectivity_base, used as a building block for concrete graphs. More...
class	sequoia::maths::edge_weight_dereference_policy< Iterator >
class	sequoia::maths::connectivity< Flavour, EdgeStorage >
class	sequoia::maths::connectivity< graph_flavour::directed, EdgeStorage >

Detailed Description

Implementation for a partitioned sequence of edges, which represents a graph's connectivity.

Graphs consist of edges and nodes. If the nodes do not possess a weight, they may be treated entirely implicitly. A partitioned sequence of edges, where each partition corresponds to a node and each edges records the other node to which it attaches, suffices to competely specify the graph. This data structure will be referred to as the connectivity. For graphs with weighted nodes, the same connectivity data structure may be used, but now in conjunction with a separate structure to record the node weights.