org.thegalactic.dgraph

Class AbstractDGraph<N,E>

java.lang.Object

org.thegalactic.dgraph.AbstractDGraph<N,E>

Type Parameters:

N - Node content type

E - Edge content type

All Implemented Interfaces:

DGraph<N,E>

Direct Known Subclasses:

ConcreteDGraph

public abstract class AbstractDGraph<N,E>
extends Object
implements DGraph<N,E>

AbstractDGraph.

Constructor Summary

Constructors

Modifier	Constructor and Description
protected	AbstractDGraph() Basic constructor.

Method Summary

Modifier and Type	Method and Description
SortedSet<Node<N>>	getSinks() Returns the sinks of this component.
SortedSet<Node<N>>	getWells() Returns the wells of this component.
boolean	isAcyclic() Check if this component is acyclic.
void	save(String filename) Save the description of this component in a file whose name is specified.
List<Node<N>>	topologicalSort() Returns a topological sort of the node of this component.
String	toString() Returns a String representation of this component.

Methods inherited from class java.lang.Object

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

Methods inherited from interface org.thegalactic.dgraph.DGraph

getEdges, getNodes, getPredecessorEdges, getPredecessorNodes, getSuccessorEdges, getSuccessorNodes, sizeEdges, sizeNodes

Constructor Detail

AbstractDGraph

protected AbstractDGraph()

Basic constructor.

Method Detail

toString

public final String toString()

Returns a String representation of this component.

Specified by:

toString in interface DGraph<N,E>

Overrides:

toString in class Object

Returns:

the string representation

save

public void save(String filename)
          throws IOException

Save the description of this component in a file whose name is specified.

Specified by:

save in interface DGraph<N,E>

Parameters:

filename - the name of the file

Throws:

IOException - When an IOException occurs

getSinks

public final SortedSet<Node<N>> getSinks()

Returns the sinks of this component.

Specified by:

getSinks in interface DGraph<N,E>

Returns:

the sinks

getWells

public final SortedSet<Node<N>> getWells()

Returns the wells of this component.

Specified by:

getWells in interface DGraph<N,E>

Returns:

the wells

isAcyclic

public final boolean isAcyclic()

Check if this component is acyclic.

Returns:

true if the component is acyclic

topologicalSort

public final List<Node<N>> topologicalSort()

Returns a topological sort of the node of this component.

This topological sort is a sort on all the nodes according to their successors. If the graph is not acyclic, some nodes don’t belong to the sort. This treatment is performed in O(n+m), where n corresponds to the number of nodes, and m corresponds to the number of edges.

Returns:

the nodes