salvo.jesus.graph.algorithm

Class GraphUnionAlgorithm

java.lang.Object

salvo.jesus.graph.algorithm.GraphUnionAlgorithm

public class GraphUnionAlgorithm
extends Object

GraphUnionAlgorithm is an algorithm class for managing the operation of taking the union of graphs (directed or undirected). The equivalence function used to combine graph components is the object identity of the vertices and edges themselves.

Author:

John V. Sichi

Constructor Summary

Constructors

Constructor and Description
GraphUnionAlgorithm(Graph gResult) Begin a new union.

Method Summary

Modifier and Type	Method and Description
Graph	getGraph()
void	union(Graph gSrc) Merge a graph into the union.

Methods inherited from class java.lang.Object

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

Constructor Detail

GraphUnionAlgorithm

public GraphUnionAlgorithm(Graph gResult)

Begin a new union. The union will be written to the graph specified as a parameter, which need not be empty to start with.

Parameters:

gResult - the union target, which will be modified in place

Method Detail

getGraph

public Graph getGraph()

Returns:

the union result graph specified in the constructor

union

public void union(Graph gSrc)
           throws Exception

Merge a graph into the union.

Parameters:

gSrc - the graph to add; this graph is unmodified by the operation

Throws:

Exception - if the result graph cannot be modified