org.polarsys.capella.common.utils.graph

Class BasicDirectedGraph<T>

java.lang.Object

org.polarsys.capella.common.utils.graph.BasicDirectedGraph<T>

All Implemented Interfaces:

IDirectedGraph<T>

public class BasicDirectedGraph<T>
extends java.lang.Object
implements IDirectedGraph<T>

A simple implementation of DirectedGraph

Constructor Summary

Constructors

Constructor and Description
BasicDirectedGraph()

Method Summary

Modifier and Type	Method and Description
void	addEdge(T source, T successor) Add a new edge to the graph.
void	addNode(T node) Add a node to the graph.
java.util.Iterator<T>	getNodes() Which are the nodes of the graph?
java.util.Iterator<T>	getSucessors(T source) Given a node 'source', which are this nodes children, i.e.

Methods inherited from class java.lang.Object

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

Constructor Detail

BasicDirectedGraph

public BasicDirectedGraph()

Method Detail

getSucessors

public java.util.Iterator<T> getSucessors(T source)

Given a node 'source', which are this nodes children, i.e. the nodes that are directly reachable from the source node

Specified by:

getSucessors in interface IDirectedGraph<T>

Parameters:

source - the source node

Returns:

the list of child nodes of source

addEdge

public void addEdge(T source,
                    T successor)

Add a new edge to the graph. Adding an edge automatically adds the source and target nodes to the graph. You don't need to explicitly call addNode in this case.

Parameters:

source -

successor -

addNode

public void addNode(T node)

Add a node to the graph.

Parameters:

node -

getNodes

public java.util.Iterator<T> getNodes()

Which are the nodes of the graph?

Specified by:

getNodes in interface IDirectedGraph<T>

Returns: