Changeset 1631:e15162d8eca1 in lemon-0.x for lemon/kruskal.h
- Timestamp:
- 08/16/05 21:06:59 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2139
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/kruskal.h
r1603 r1631 52 52 /// \param g The graph the algorithm runs on. 53 53 /// It can be either \ref concept::StaticGraph "directed" or 54 /// \ref concept::Undir StaticGraph "undirected".54 /// \ref concept::UndirGraph "undirected". 55 55 /// If the graph is directed, the algorithm consider it to be 56 56 /// undirected by disregarding the direction of the edges. … … 89 89 /// \return The cost of the found tree. 90 90 /// 91 /// \warning If kruskal is run on an \ref undirected graph, be sure that the 91 /// \warning If kruskal is run on an 92 /// \ref lemon::concept::UndirGraph "undirected graph", be sure that the 92 93 /// map storing the tree is also undirected 93 94 /// (e.g. UndirListGraph::UndirEdgeMap<bool>, otherwise the values of the
Note: See TracChangeset
for help on using the changeset viewer.