fr.ign.cogit.cartagen.graph

Interface IGraph

All Known Subinterfaces:

ITriangulation

All Known Implementing Classes:

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

public interface IGraph

Method Summary

Modifier and Type	Method and Description
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.
Set<INode>	getNodes() the nodes of the graph
Set<GraphPath>	getPaths() the paths within the graph
boolean	isOriented() is the graph oriented ?
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)

Method Detail

getId

int getId()

the id of the graph

setId

void setId(int id)

getEdges

Set<IEdge> getEdges()

the edges of the graph

setEdges

void setEdges(Set<IEdge> arcs)

getNodes

Set<INode> getNodes()

the nodes of the graph

setNodes

void setNodes(Set<INode> nodes)

getName

String getName()

the name of the graph

setName

void setName(String name)

isOriented

boolean isOriented()

is the graph oriented ?

setOriented

void setOriented(boolean oriented)

getPaths

Set<GraphPath> getPaths()

the paths within the graph

setPaths

void setPaths(Set<GraphPath> paths)

getEdgesConnectingNodes

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

Get all the edges connecting two nodes.

Parameters:

node1 -

node2 -

Returns:

getNodeAt

INode getNodeAt(IDirectPosition pt)

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

Parameters:

pt -

Returns: