Jcg.graph

Interface GeometricGraph<X extends Point_>

All Superinterfaces:

Graph<Node<X>>

All Known Implementing Classes:

GeometricGraph_2, GeometricGraph_3, GraphDrawing_2

public interface GeometricGraph<X extends Point_>
extends Graph<Node<X>>

Implementation of a geometric graph (generic and undirected)

Version:

dec 2012

Author:

Luca Castelli Aleardi, Ecole Polytechnique (INF562)

Method Summary

Modifier and Type	Method and Description
void	addNode(X p) Add a new vertex to the graph (with its geometric coordinates)
X[]	boundingBox() Compute the bounding box (enclosing the vertices of the graph)
X	getPoint(Node<X> v) Return the geometric coordinates of a vertex
java.util.ArrayList<X>	listOfPoints() Return the list of points associated to the vertices of the graph
void	setPoint(Node<X> v, X p) Set the geometric coordinates of a vertex

Methods inherited from interface Jcg.graph.Graph

addEdge, addNode, adjacent, degree, getNeighbors, removeEdge, removeNode, sizeVertices

Method Detail

setPoint

void setPoint(Node<X> v,
              X p)

Set the geometric coordinates of a vertex

getPoint

X getPoint(Node<X> v)

Return the geometric coordinates of a vertex

addNode

void addNode(X p)

Add a new vertex to the graph (with its geometric coordinates)

listOfPoints

java.util.ArrayList<X> listOfPoints()

Return the list of points associated to the vertices of the graph

boundingBox

X[] boundingBox()

Compute the bounding box (enclosing the vertices of the graph)

Returns:

X[] the array containing the min and max bounds