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

Concept definition

template<class D>
concept can_kruskal_with = requires { typename Kruskal_Min_Spanning_Tree<LG, D>; }
Aleph::Kruskal_Min_Spanning_Tree
Computes the minimum spanning tree of a graph using Kruskal's algorithm.
Definition Kruskal.H:92
can_kruskal_with
Definition ah_graph_concepts_test.cc:81

Detailed Description

Definition at line 81 of file ah_graph_concepts_test.cc.