Modifier and Type | Method and Description |
---|---|
void |
addEdge(INode node1,
INode node2)
Adds an edge to the graph, only if it is possible, i.e. there is no edge
already added between both nodes.
|
List<INode> |
getLeaves() |
GraphPath |
getLongestPathBetweenLeaves()
Compute the longest path between any two leaves of the tree.
|
computeCentralities, computeDijkstraShortestPath, cutInConnexParts, equals, getEdgeFromGeoObj, getEdges, getEdgesConnectingNodes, getId, getName, getNodeAt, getNodeFromGeoObj, getNodes, getPaths, hashCode, isOriented, nodeEdgeRatio, setEdges, setId, setName, setNodes, setOriented, setPaths, toString
public TreeGraph(String name)
public void addEdge(INode node1, INode node2)
node1
- node2
- public GraphPath getLongestPathBetweenLeaves()
Copyright © 2016 Laboratoire COGIT, IGN. All rights reserved.