Abstract Graphs

Like abstract datasets, the graph concepts svs::graphs::ImmutableMemoryGraph and svs::graphs::MemoryGraph are used to model the expected behavior of graphs. Concrete implementations can be found here.

Main Concepts

Warning

doxygenconcept: Cannot find concept “svs::graphs::ImmutableMemoryGraph” in doxygen xml output for project “SVS” from directory: /home/runner/work/_temp/build_docs/docs/doxygen/xml

Warning

doxygenconcept: Cannot find concept “svs::graphs::MemoryGraph” in doxygen xml output for project “SVS” from directory: /home/runner/work/_temp/build_docs/docs/doxygen/xml

Public API

template<ImmutableMemoryGraph G>
using index_type_t = typename G::index_type

Obtain the index type used to encode neighbors in the graph type G.

template<ImmutableMemoryGraph Graph1, ImmutableMemoryGraph Graph2>
bool graphs_equal(const Graph1 &x, const Graph2 &y)

Compare the equality of two graphs.

Two graphs are considered equal if:

• The contain the same number of vertices.

• The adjacency lists for each vertex compare equal.