|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
V
- vertex concept typeE
- edge concept typepublic interface MinimumSpanningTree<V,E>
Allows to derive minimum spanning tree from given undirected connected graph. In the case of disconnected graphs it would rather derive minimum spanning forest
Method Summary | |
---|---|
Set<E> |
getMinimumSpanningTreeEdgeSet()
Returns edges set constituting the minimum spanning tree/forest |
double |
getMinimumSpanningTreeTotalWeight()
Returns total weight of the minimum spanning tree/forest. |
Method Detail |
---|
Set<E> getMinimumSpanningTreeEdgeSet()
double getMinimumSpanningTreeTotalWeight()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |