fr.ign.cogit.cartagen.graph

Class Graph

Object

Graph

All Implemented Interfaces:

IGraph

Direct Known Subclasses:

DualGraph, GabrielGraph, GraphWithFaces, MinSpanningTree, NearestNeighbourGraph, RelativeNeighbourhoodGraph, TreeGraph, Triangulation

public class Graph
extends Object
implements IGraph

Constructor Summary

Constructors

Constructor and Description
Graph(String name, boolean oriented)
Graph(String name, boolean oriented, Collection<INetworkSection> linearFeatures) A constructor based on linear features that implements the standardised COGIT network element interface.
Graph(String name, boolean oriented, Set<? extends ArcReseau> linearFeatures) A constructor based on linear features that implements the standardised COGIT network element interface.

Method Summary

Modifier and Type	Method and Description
void	computeCentralities()
GraphPath	computeDijkstraShortestPath(INode initialNode, INode finalNode) Compute the shortest path between two nodes of the graph using Dijkstra algorithm.
Set<HashSet<INode>>	cutInConnexParts() Cut the graph into connex parts.
boolean	equals(Object arg0)
IEdge	getEdgeFromGeoObj(IFeature feature)
Set<IEdge>	getEdges() the edges of the graph
Set<IEdge>	getEdgesConnectingNodes(INode node1, INode node2) Get all the edges connecting two nodes.
int	getId() the id of the graph
String	getName() the name of the graph
INode	getNodeAt(IDirectPosition pt) Get the node of the graph that is located at a given position.
INode	getNodeFromGeoObj(IFeature feature)
Set<INode>	getNodes() the nodes of the graph
Set<GraphPath>	getPaths() the paths within the graph
int	hashCode()
boolean	isOriented() is the graph oriented ?
double	nodeEdgeRatio() Get the ratio of nodes in relation to edges
void	setEdges(Set<IEdge> arcs)
void	setId(int id)
void	setName(String name)
void	setNodes(Set<INode> nodes)
void	setOriented(boolean oriented)
void	setPaths(Set<GraphPath> paths)
String	toString()

Methods inherited from class Object

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

Constructor Detail

Graph

public Graph(String name,
             boolean oriented)

Graph

public Graph(String name,
             boolean oriented,
             Set<? extends ArcReseau> linearFeatures)

A constructor based on linear features that implements the standardised COGIT network element interface.

Parameters:

name -

oriented -

linearFeatures -

Graph

public Graph(String name,
             boolean oriented,
             Collection<INetworkSection> linearFeatures)

A constructor based on linear features that implements the standardised COGIT network element interface.

Parameters:

name -

oriented -

linearFeatures -

Method Detail

getEdges

public Set<IEdge> getEdges()

Description copied from interface: IGraph

the edges of the graph

Specified by:

getEdges in interface IGraph

setEdges

public void setEdges(Set<IEdge> arcs)

Specified by:

setEdges in interface IGraph

getNodes

public Set<INode> getNodes()

Description copied from interface: IGraph

the nodes of the graph

Specified by:

getNodes in interface IGraph

setNodes

public void setNodes(Set<INode> nodes)

Specified by:

setNodes in interface IGraph

getName

public String getName()

Description copied from interface: IGraph

the name of the graph

Specified by:

getName in interface IGraph

setName

public void setName(String name)

Specified by:

setName in interface IGraph

isOriented

public boolean isOriented()

Description copied from interface: IGraph

is the graph oriented ?

Specified by:

isOriented in interface IGraph

setOriented

public void setOriented(boolean oriented)

Specified by:

setOriented in interface IGraph

getId

public int getId()

Description copied from interface: IGraph

the id of the graph

Specified by:

getId in interface IGraph

setId

public void setId(int id)

Specified by:

setId in interface IGraph

getPaths

public Set<GraphPath> getPaths()

Description copied from interface: IGraph

the paths within the graph

Specified by:

getPaths in interface IGraph

setPaths

public void setPaths(Set<GraphPath> paths)

Specified by:

setPaths in interface IGraph

equals

public boolean equals(Object arg0)

Overrides:

equals in class Object

hashCode

public int hashCode()

Overrides:

hashCode in class Object

toString

public String toString()

Overrides:

toString in class Object

computeDijkstraShortestPath

public GraphPath computeDijkstraShortestPath(INode initialNode,
                                             INode finalNode)

Compute the shortest path between two nodes of the graph using Dijkstra algorithm. Usable for small graphs as all is computed in memory.

Parameters:

initialNode - : the initial node

finalNode - : the final node.

Returns:

GraphPath : returns a GraphPath object describing the shortest path.

getNodeFromGeoObj

public INode getNodeFromGeoObj(IFeature feature)

getEdgeFromGeoObj

public IEdge getEdgeFromGeoObj(IFeature feature)

cutInConnexParts

public Set<HashSet<INode>> cutInConnexParts()

Cut the graph into connex parts. The nodes of each connex part are clustered in a set.

Returns:

HashSet : a set of sets of nodes.

computeCentralities

public void computeCentralities()

nodeEdgeRatio

public double nodeEdgeRatio()

Get the ratio of nodes in relation to edges

Returns:

getEdgesConnectingNodes

public Set<IEdge> getEdgesConnectingNodes(INode node1,
                                          INode node2)

Description copied from interface: IGraph

Get all the edges connecting two nodes.

Specified by:

getEdgesConnectingNodes in interface IGraph

Returns:

getNodeAt

public INode getNodeAt(IDirectPosition pt)

Description copied from interface: IGraph

Get the node of the graph that is located at a given position.

Specified by:

getNodeAt in interface IGraph

Returns: