horstmann.ch08_graphed

Class Graph

java.lang.Object

horstmann.ch08_graphed.Graph

All Implemented Interfaces:

java.io.Serializable

Direct Known Subclasses:

SimpleGraph

public abstract class Graph
extends java.lang.Object
implements java.io.Serializable

A graph consisting of selectable nodes and edges.

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
Graph() Constructs a graph with no nodes or edges.

Method Summary

Modifier and Type	Method and Description
boolean	add(Node n, java.awt.geom.Point2D p) Adds a node to the graph so that the top left corner of the bounding rectangle is at the given point.
boolean	connect(Edge e, java.awt.geom.Point2D p1, java.awt.geom.Point2D p2) Adds an edge to the graph that joins the nodes containing the given points.
void	draw(java.awt.Graphics2D g2) Draws the graph
Edge	findEdge(java.awt.geom.Point2D p) Finds an edge containing the given point.
Node	findNode(java.awt.geom.Point2D p) Finds a node containing the given point.
java.awt.geom.Rectangle2D	getBounds(java.awt.Graphics2D g2) Gets the smallest rectangle enclosing the graph
abstract Edge[]	getEdgePrototypes() Gets the edge types of a particular graph type.
java.util.List<Edge>	getEdges() Gets the edges of this graph.
abstract Node[]	getNodePrototypes() Gets the node types of a particular graph type.
java.util.List<Node>	getNodes() Gets the nodes of this graph.
void	removeEdge(Edge e) Removes an edge from the graph.
void	removeNode(Node n) Removes a node and all edges that start or end with that node

Methods inherited from class java.lang.Object

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

Constructor Detail

Graph

public Graph()

Constructs a graph with no nodes or edges.

Method Detail

connect

public boolean connect(Edge e,
                       java.awt.geom.Point2D p1,
                       java.awt.geom.Point2D p2)

Adds an edge to the graph that joins the nodes containing the given points. If the points aren't both inside nodes, then no edge is added.

Parameters:

e - the edge to add

p1 - a point in the starting node

p2 - a point in the ending node

add

public boolean add(Node n,
                   java.awt.geom.Point2D p)

Adds a node to the graph so that the top left corner of the bounding rectangle is at the given point.

Parameters:

n - the node to add

p - the desired location

findNode

public Node findNode(java.awt.geom.Point2D p)

Finds a node containing the given point.

Parameters:

p - a point

Returns:

a node containing p or null if no nodes contain p

findEdge

public Edge findEdge(java.awt.geom.Point2D p)

Finds an edge containing the given point.

Parameters:

p - a point

Returns:

an edge containing p or null if no edges contain p

draw

public void draw(java.awt.Graphics2D g2)

Draws the graph

Parameters:

g2 - the graphics context

removeNode

public void removeNode(Node n)

Removes a node and all edges that start or end with that node

Parameters:

n - the node to remove

removeEdge

public void removeEdge(Edge e)

Removes an edge from the graph.

Parameters:

e - the edge to remove

getBounds

public java.awt.geom.Rectangle2D getBounds(java.awt.Graphics2D g2)

Gets the smallest rectangle enclosing the graph

Parameters:

g2 - the graphics context

Returns:

the bounding rectangle

getNodePrototypes

public abstract Node[] getNodePrototypes()

Gets the node types of a particular graph type.

Returns:

an array of node prototypes

getEdgePrototypes

public abstract Edge[] getEdgePrototypes()

Gets the edge types of a particular graph type.

Returns:

an array of edge prototypes

getNodes

public java.util.List<Node> getNodes()

Gets the nodes of this graph.

Returns:

an unmodifiable list of the nodes

getEdges

public java.util.List<Edge> getEdges()

Gets the edges of this graph.

Returns:

an unmodifiable list of the edges