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

Concept definition

template<class G>
concept can_dijkstra = requires { typename Dijkstra_Min_Paths<G>; }
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
Definition ah_graph_concepts_test.cc:77

Detailed Description

Definition at line 77 of file ah_graph_concepts_test.cc.