ai.libs.jaicore.graph

Class Graph<T>

java.lang.Object

ai.libs.jaicore.graph.Graph<T>

All Implemented Interfaces:

java.io.Serializable

Direct Known Subclasses:

LabeledGraph

public class Graph<T>
extends java.lang.Object
implements java.io.Serializable

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
Graph()
Graph(java.util.Collection<T> nodes)
Graph(Graph<T> toClone)
Graph(T node)

Method Summary

Modifier and Type	Method and Description
void	addEdge(T from, T to)
void	addGraph(Graph<T> g)
void	addItem(T item)
boolean	equals(java.lang.Object obj)
java.util.Set<Pair<T,T>>	getEdges()
java.util.Set<T>	getItems()
java.lang.String	getLineBasedStringRepresentation() Creates a new line for each path in the graph where the prefix common to the previous line is omitted.
java.lang.String	getLineBasedStringRepresentation(int offset)
java.util.Set<T>	getPredecessors(T item)
T	getRoot()
java.util.Collection<T>	getSinks()
java.util.Collection<T>	getSources()
java.util.Set<T>	getSuccessors(T item)
int	hashCode()
boolean	hasItem(T item)
boolean	isEmpty()
boolean	isGraphSane()
void	removeEdge(T from, T to)
void	removeItem(T item)

Methods inherited from class java.lang.Object

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

Constructor Detail

Graph

public Graph()

Graph

public Graph(T node)

Graph

public Graph(java.util.Collection<T> nodes)

Graph

public Graph(Graph<T> toClone)

Method Detail

addItem

public void addItem(T item)

getItems

public java.util.Set<T> getItems()

hasItem

public boolean hasItem(T item)

removeItem

public void removeItem(T item)

addEdge

public void addEdge(T from,
                    T to)

removeEdge

public void removeEdge(T from,
                       T to)

getSuccessors

public java.util.Set<T> getSuccessors(T item)

getPredecessors

public java.util.Set<T> getPredecessors(T item)

getSources

public final java.util.Collection<T> getSources()

getRoot

public final T getRoot()

getSinks

public final java.util.Collection<T> getSinks()

addGraph

public final void addGraph(Graph<T> g)

isEmpty

public boolean isEmpty()

getEdges

public java.util.Set<Pair<T,T>> getEdges()

hashCode

public int hashCode()

Overrides:

hashCode in class java.lang.Object

equals

public boolean equals(java.lang.Object obj)

Overrides:

equals in class java.lang.Object

getLineBasedStringRepresentation

public java.lang.String getLineBasedStringRepresentation()

Creates a new line for each path in the graph where the prefix common to the previous line is omitted. The order is obtained by BFS.

getLineBasedStringRepresentation

public java.lang.String getLineBasedStringRepresentation(int offset)

isGraphSane

public boolean isGraphSane()