org.jsweet.transpiler.util

Class DirectedGraph.Node<T>

java.lang.Object

org.jsweet.transpiler.util.DirectedGraph.Node<T>

Type Parameters:

T - the type of object hold in the graph

Enclosing class:

DirectedGraph<T>

public static class DirectedGraph.Node<T>
extends Object

An object representing the nodes of the graph.

It stores elements and remembers edges.

Author:

Renaud Pawlak

Field Summary

Fields

Modifier and Type	Field and Description
T	element The actual element (data) hold by this node.
LinkedHashSet<DirectedGraph.Edge<T>>	inEdges The edges entering this node.
LinkedHashSet<DirectedGraph.Edge<T>>	outEdges The edges leaving from this node.
LinkedHashSet<DirectedGraph.Edge<T>>	usedInEdges Information used for sorting only.
LinkedHashSet<DirectedGraph.Edge<T>>	usedOutEdges Information used for sorting only.

Constructor Summary

Constructors

Constructor and Description
Node(DirectedGraph<T> graph, T element) Creates a new node for the given graph and holding the given element.

Method Summary

Modifier and Type	Method and Description
void	addEdge(T destinationElement) Adds an edge starting from this node and going to a node holding the given element.
void	addEdges(T... destinationElements) Adds edges starting from this node and going to nodes holding the given elements.
void	resetEdges() Clears sorting info.
String	toString()
void	useInEdge(DirectedGraph.Edge<T> edge) Used for sorting only.
void	useOutEdge(DirectedGraph.Edge<T> edge) Used for sorting only.

Methods inherited from class java.lang.Object

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

Field Detail

element

public final T element

The actual element (data) hold by this node.

inEdges

public final LinkedHashSet<DirectedGraph.Edge<T>> inEdges

The edges entering this node.

usedInEdges

public final LinkedHashSet<DirectedGraph.Edge<T>> usedInEdges

Information used for sorting only.

outEdges

public final LinkedHashSet<DirectedGraph.Edge<T>> outEdges

The edges leaving from this node.

usedOutEdges

public final LinkedHashSet<DirectedGraph.Edge<T>> usedOutEdges

Information used for sorting only.

Constructor Detail

Node

public Node(DirectedGraph<T> graph,
            T element)

Creates a new node for the given graph and holding the given element.

Parameters:

graph - the graph this node belongs to

element - the element hold by this node

Method Detail

addEdge

public void addEdge(T destinationElement)

Adds an edge starting from this node and going to a node holding the given element.

addEdges

public void addEdges(T... destinationElements)

Adds edges starting from this node and going to nodes holding the given elements.

useInEdge

public void useInEdge(DirectedGraph.Edge<T> edge)

Used for sorting only.

useOutEdge

public void useOutEdge(DirectedGraph.Edge<T> edge)

Used for sorting only.

resetEdges

public void resetEdges()

Clears sorting info.

toString

public String toString()

Overrides:

toString in class Object