org.ginsim.core.graph.tree

Class TreeImpl

java.lang.Object

org.ginsim.core.graph.AbstractGraph<TreeNode,TreeEdge>

org.ginsim.core.graph.tree.TreeImpl

All Implemented Interfaces:

Graph<TreeNode,TreeEdge>, GraphModel<TreeNode,TreeEdge>, GraphViewListener, Tree

public class TreeImpl
extends AbstractGraph<TreeNode,TreeEdge>
implements Tree

Field Summary

Fields

Modifier and Type	Field and Description
static TreeNode[]	leafs The tree pendant to OMDDNode.TERMINALS
static TreeNode	MINUS_ONE_NODE
static int	MODE_DIAGRAM
static int	MODE_DIAGRAM_WITH_MULTIPLE_LEAFS
static int	MODE_TREE
TreeNode	root

Fields inherited from class org.ginsim.core.graph.AbstractGraph

attributes, graphAnnotation, graphName, ZIP_PREFIX

Constructor Summary

Constructors

Constructor and Description
TreeImpl(TreeBuilder parser) Create a new Tree and link it to the parser.

Method Summary

Modifier and Type	Method and Description
TreeEdge	addEdge(TreeNode source, TreeNode target, int value) add an edge between source and target
boolean	containsNode(TreeNode node) Indicates if the tree contains a node
protected List<?>	doMerge(Graph<TreeNode,TreeEdge> graph) Specialized method that execute the merging of the given graph with the current one Must be override at specialized graph level
int	getMode()
int	getNodeOrderSize() Return the size of the node order
TreeBuilder	getParser()
Graph<TreeNode,TreeEdge>	getSubgraph(Collection<TreeNode> vertex, Collection<TreeEdge> edges) Specialized method that build the sub-graph corresponding to the given lists of vertices and edges The returned graph contains clones of the given graph objects structured as they are in the current graph
void	setMode(int treeMode)
void	setRoot(TreeNode root) Define the root (a TreeNode) of the tree

Methods inherited from class org.ginsim.core.graph.AbstractGraph

addEdge, addNode, addViewListener, containsEdge, copyView, damage, doSave, fireGraphChange, fireMetaChange, getAnnotation, getAttributes, getCachedEdgeAttributeReader, getCachedNodeAttributeReader, getDimension, getDisplayName, getEdge, getEdgeAttributeReader, getEdges, getExistingNode, getGINMLWriter, getGraphName, getGraphZipName, getIncomingEdges, getNodeAttributeReader, getNodeByName, getNodeCount, getNodes, getOutgoingEdges, getShortestPath, getStronglyConnectedComponents, getStyleManager, isEmpty, merge, refresh, removeEdge, removeNode, repaint, save, save, searchNodes, setAttribute, setGraphName

Methods inherited from class java.lang.Object

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

Methods inherited from interface org.ginsim.core.graph.Graph

addViewListener, copyView, fireGraphChange, getAttributes, getDimension, getDisplayName, getEdgeAttributeReader, getNodeAttributeReader, getStyleManager, save, save, setAttribute

Methods inherited from interface org.ginsim.core.graph.GraphModel

addEdge, addNode, containsEdge, getAnnotation, getEdge, getEdges, getExistingNode, getGraphName, getIncomingEdges, getNodeByName, getNodeCount, getNodes, getOutgoingEdges, getShortestPath, getStronglyConnectedComponents, merge, removeEdge, removeNode, searchNodes, setGraphName

Field Detail

MODE_DIAGRAM_WITH_MULTIPLE_LEAFS

public static final int MODE_DIAGRAM_WITH_MULTIPLE_LEAFS

See Also:

Constant Field Values

MODE_DIAGRAM

public static final int MODE_DIAGRAM

See Also:

Constant Field Values

MODE_TREE

public static final int MODE_TREE

See Also:

Constant Field Values

MINUS_ONE_NODE

public static final TreeNode MINUS_ONE_NODE

leafs

public static TreeNode[] leafs

The tree pendant to OMDDNode.TERMINALS

root

public TreeNode root

Constructor Detail

TreeImpl

public TreeImpl(TreeBuilder parser)

Create a new Tree and link it to the parser.

Parameters:

parser - the parser that will fill the tree.

Method Detail

containsNode

public boolean containsNode(TreeNode node)

Indicates if the tree contains a node

Specified by:

containsNode in interface GraphModel<TreeNode,TreeEdge>

Specified by:

containsNode in interface Tree

Overrides:

containsNode in class AbstractGraph<TreeNode,TreeEdge>

Parameters:

node -

Returns:

true if the tree contains the node

addEdge

public TreeEdge addEdge(TreeNode source,
                        TreeNode target,
                        int value)

add an edge between source and target

Specified by:

addEdge in interface Tree

Parameters:

source -

target -

Returns:

the new edge

setRoot

public void setRoot(TreeNode root)

Description copied from interface: Tree

Define the root (a TreeNode) of the tree

Specified by:

setRoot in interface Tree

Parameters:

root - define the root

getMode

public int getMode()

Specified by:

getMode in interface Tree

setMode

public void setMode(int treeMode)

Specified by:

setMode in interface Tree

getParser

public TreeBuilder getParser()

Specified by:

getParser in interface Tree

getNodeOrderSize

public int getNodeOrderSize()

Return the size of the node order

Specified by:

getNodeOrderSize in interface GraphModel<TreeNode,TreeEdge>

Specified by:

getNodeOrderSize in class AbstractGraph<TreeNode,TreeEdge>

Returns:

the size of the node order

doMerge

protected List<?> doMerge(Graph<TreeNode,TreeEdge> graph)

Description copied from class: AbstractGraph

Specialized method that execute the merging of the given graph with the current one Must be override at specialized graph level

Specified by:

doMerge in class AbstractGraph<TreeNode,TreeEdge>

Returns:

getSubgraph

public Graph<TreeNode,TreeEdge> getSubgraph(Collection<TreeNode> vertex,
                                            Collection<TreeEdge> edges)

Description copied from class: AbstractGraph

Specialized method that build the sub-graph corresponding to the given lists of vertices and edges The returned graph contains clones of the given graph objects structured as they are in the current graph

Specified by:

getSubgraph in interface GraphModel<TreeNode,TreeEdge>

Specified by:

getSubgraph in class AbstractGraph<TreeNode,TreeEdge>

Parameters:

vertex - the list of node to include in the desired sub-graph

edges - the list of edges to include in the sub-graph

Returns:

a Graph containing clones of initial vertices and edges structured as they are in the current graph