Package com.actelion.research.calc.graph
Class MinimumSpanningTree
- java.lang.Object
-
- com.actelion.research.calc.graph.MinimumSpanningTree
-
public class MinimumSpanningTree extends java.lang.Object
MinimumSpanningTree Kruskal's algorithmCopyright: Actelion Ltd., Inc. All Rights Reserved This software is the proprietary information of Actelion Pharmaceuticals, Ltd. Use is subject to license terms.
- Version:
- 1.0 Dec 17, 2012 MvK Start implementation
- Author:
- Modest von Korff
-
-
Constructor Summary
Constructors Constructor Description MinimumSpanningTree(Matrix maAdjacency)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description Matrix
getMST()
-
-
-
Constructor Detail
-
MinimumSpanningTree
public MinimumSpanningTree(Matrix maAdjacency)
- Parameters:
maAdjacency
- adjacency matrix, only the upper triangle is used. Non bonding fields have to be indicated asNaN
.
-
-
Method Detail
-
getMST
public Matrix getMST()
- Returns:
- symmetric adjacency matrix. If an edge is a member of the tree the upper and lower triangle contain the corresponding value from the input adjacency matrix.
-
-