Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
can_dijkstra_with Concept Reference

Concept definition

template<class D>
concept can_dijkstra_with = requires { typename Dijkstra_Min_Paths<LG, D>; }
Aleph::Dijkstra_Min_Paths
Spanning tree calculation of all shortest paths from a given node according to Dijkstra's algorithm.
Definition Dijkstra.H:103
can_dijkstra_with
Definition ah_graph_concepts_test.cc:79

Detailed Description

Definition at line 79 of file ah_graph_concepts_test.cc.