Jcg.graph

Class GeometricGraph_2

java.lang.Object

Jcg.graph.AdjacencyListGraph<Node<Point_2>>

Jcg.graph.GeometricGraph_2

All Implemented Interfaces:

GeometricGraph<Point_2>, Graph<Node<Point_2>>

Direct Known Subclasses:

GraphDrawing_2

public class GeometricGraph_2
extends AdjacencyListGraph<Node<Point_2>>
implements GeometricGraph<Point_2>

Implementation of a geometric graph, whose vertices correspond to 2D points

Version:

dec 2012

Author:

Luca Castelli Aleardi, Ecole Polytechnique (INF562)

Field Summary

Fields inherited from class Jcg.graph.AdjacencyListGraph

vertices

Constructor Summary

Constructors

Constructor and Description
GeometricGraph_2() Create a new graph
GeometricGraph_2(int n) Create a graph of size n

Method Summary

Modifier and Type	Method and Description
void	addNode(Point_2 p) Add a new vertex to the graph (with its geometric coordinates)
Point_2[]	boundingBox() compute and return the bounding box for the points set.
java.util.List<Point_2[]>	computeEdges() Return the list of edges of the graph (their corresponding segments)
Point_2	getPoint(Node<Point_2> v) Return the geometric coordinates of a vertex
Point_2[]	getSegment(Node<Point_2> u, Node<Point_2> v) Return the straight-line segment having as extremities two given vertices of the graph
java.util.ArrayList<Point_2>	listOfPoints() Return the list of vertex points of the graph
void	setPoint(Node<Point_2> v, Point_2 p) Set the geometric coordinates of a vertex

Methods inherited from class Jcg.graph.AdjacencyListGraph

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

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface Jcg.graph.Graph

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

Constructor Detail

GeometricGraph_2

public GeometricGraph_2()

Create a new graph

GeometricGraph_2

public GeometricGraph_2(int n)

Create a graph of size n

Parameters:

n - the number of vertices

Method Detail

setPoint

public void setPoint(Node<Point_2> v,
                     Point_2 p)

Set the geometric coordinates of a vertex

Specified by:

setPoint in interface GeometricGraph<Point_2>

getPoint

public Point_2 getPoint(Node<Point_2> v)

Return the geometric coordinates of a vertex

Specified by:

getPoint in interface GeometricGraph<Point_2>

Parameters:

v - a vertex in the graph

addNode

public void addNode(Point_2 p)

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

Specified by:

addNode in interface GeometricGraph<Point_2>

Parameters:

p - the coordinates of the vertex to add

boundingBox

public Point_2[] boundingBox()

compute and return the bounding box for the points set. The result is stored in a table.

Specified by:

boundingBox in interface GeometricGraph<Point_2>

Returns:

X[] the array containing the min and max bounds

computeEdges

public java.util.List<Point_2[]> computeEdges()

Return the list of edges of the graph (their corresponding segments)

listOfPoints

public java.util.ArrayList<Point_2> listOfPoints()

Return the list of vertex points of the graph

Specified by:

listOfPoints in interface GeometricGraph<Point_2>

getSegment

public Point_2[] getSegment(Node<Point_2> u,
                            Node<Point_2> v)

Return the straight-line segment having as extremities two given vertices of the graph

Parameters:

u - first vertex of the edge

v - the other vertex of the edge