fr.ign.cogit.cartagen.graph

Class TreeGraph

Object

Graph

TreeGraph

All Implemented Interfaces:

IGraph

public class TreeGraph
extends Graph

Undirected graphs in which any two vertices are connected by exactly one simple path.

Author:

GTouya

Constructor Summary

Constructors

Constructor and Description
TreeGraph(String name)

Method Summary

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.

Methods inherited from class Graph

computeCentralities, computeDijkstraShortestPath, cutInConnexParts, equals, getEdgeFromGeoObj, getEdges, getEdgesConnectingNodes, getId, getName, getNodeAt, getNodeFromGeoObj, getNodes, getPaths, hashCode, isOriented, nodeEdgeRatio, setEdges, setId, setName, setNodes, setOriented, setPaths, toString

Methods inherited from class Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

TreeGraph

public TreeGraph(String name)

Method Detail

addEdge

public 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.

Parameters:

node1 -

node2 -

getLeaves

public List<INode> getLeaves()

getLongestPathBetweenLeaves

public GraphPath getLongestPathBetweenLeaves()

Compute the longest path between any two leaves of the tree.

Returns: