Graph-V2 API Reference
Concepts
-
template<class G>
concept vertex_range
-
template<class G, class E>
concept targeted_edge - #include <graph.hpp>
Concept for a targeted edge.
A normal targeted edge has both the
target_id(g,uv)andtarget(g,uv)function defined for it.- tparam G:
The graph type.
- tparam E:
The edge type.
-
template<class G, class E>
concept sourced_edge
-
template<class G>
concept adjacency_list - #include <graph.hpp>
Concept for an adjacency list graph.
A basic_adjacency_list list defines the minimal adjacency list concept with a vertex_id and with a vertex object.
- tparam G:
The graph type.
-
template<class G>
concept sourced_adjacency_list - #include <graph.hpp>
Concept for an adjacency list graph.
A basic_adjacency_list list defines the minimal adjacency list concept with a vertex_id and with a vertex object. The edge type has a source_id.
- tparam G:
The graph type.
-
template<class G>
concept has_degree - #include <graph.hpp>
Concept for the existance of degree function for graph G.
Returns true if degree(g) exists for graph G.
- tparam G:
The graph type
-
template<class G>
concept has_find_vertex - #include <graph.hpp>
Concept for the existance of the find_vertex(g,uid) function for graph G.
Returns true if find_vertex(g,uid) exists for graph G.
- tparam G:
The graph type
-
template<class G>
concept has_contains_edge - #include <graph.hpp>
Concept for the existance of the has_contains_edge(g,uid,vid) function for graph G.
Returns true if has_contains_edge(g,uid,vid) exists for graph G.
- tparam G:
The graph type
-
template<class G, class E>
concept ordered_edge
-
template<class G, class E>
concept unordered_edge
Algorithms
Warning
doxygenfunction: Unable to resolve function “std::graph::dijkstra_shortest_distances” with arguments None in doxygen xml output for project “graph-v2” from directory: ./_doxygen/xml. Potential matches:
- template<index_adjacency_list G, ranges::random_access_range Distances, class Compare, class Combine, class WF = std::function<ranges::range_value_t<Distances>(edge_reference_t<G>)>, class Allocator = allocator<vertex_id_t<G>>> void dijkstra_shortest_distances(G &&g, vertex_id_t<G> seed, Distances &distances, Compare &&compare, Combine &&combine, WF &&weight = [](edge_reference_t< G > uv) { return ranges::range_value_t< Distances >(1);}, Allocator alloc = Allocator())
- template<index_adjacency_list G, ranges::random_access_range Distances, class WF = std::function<ranges::range_value_t<Distances>(edge_reference_t<G>)>, class Allocator = allocator<vertex_id_t<G>>> void dijkstra_shortest_distances(G &&g, vertex_id_t<G> seed, Distances &distances, WF &&weight = [](edge_reference_t< G > uv) { return ranges::range_value_t< Distances >(1);}, Allocator alloc = Allocator())
Warning
doxygenfunction: Unable to resolve function “std::graph::dijkstra_shortest_paths” with arguments None in doxygen xml output for project “graph-v2” from directory: ./_doxygen/xml. Potential matches:
- template<index_adjacency_list G, ranges::random_access_range Distances, ranges::random_access_range Predecessors, class Compare, class Combine, class WF = function<ranges::range_value_t<Distances>(edge_reference_t<G>)>, class Allocator = allocator<vertex_id_t<G>>> void dijkstra_shortest_paths(G &&g, vertex_id_t<G> source, Distances &distances, Predecessors &predecessors, Compare &&compare, Combine &&combine, WF &&weight = [](edge_reference_t< G > uv) { return ranges::range_value_t< Distances >(1);}, Allocator alloc = Allocator())
- template<index_adjacency_list G, ranges::random_access_range Distances, ranges::random_access_range Predecessors, class WF = std::function<ranges::range_value_t<Distances>(edge_reference_t<G>)>, class Allocator = allocator<vertex_id_t<G>>> void dijkstra_shortest_paths(G &&g, vertex_id_t<G> source, Distances &distances, Predecessors &predecessors, WF &&weight = [](edge_reference_t< G > uv) { return ranges::range_value_t< Distances >(1);}, Allocator alloc = Allocator())
Warning
doxygenfunction: Cannot find function “std::graph::bellman_ford_shortest_distances” in doxygen xml output for project “graph-v2” from directory: ./_doxygen/xml
Warning
doxygenfunction: Cannot find function “std::graph::bellman_ford_shortest_paths” in doxygen xml output for project “graph-v2” from directory: ./_doxygen/xml