org.ginsim.core.graph.reducedgraph

Class ReducedGraphImpl<G extends Graph<V,E>,V,E extends Edge<V>>

java.lang.Object

org.ginsim.core.graph.AbstractGraph<V,E>

org.ginsim.core.graph.AbstractDerivedGraph<NodeReducedData,Edge<NodeReducedData>,G,V,E>

org.ginsim.core.graph.reducedgraph.ReducedGraphImpl<G,V,E>

Type Parameters:

G - type of the original graph

V - type of the original vertices

E - type of the original edges

All Implemented Interfaces:

Graph<NodeReducedData,Edge<NodeReducedData>>, GraphAssociation<G,V,E>, GraphListener<G>, GraphModel<NodeReducedData,Edge<NodeReducedData>>, GraphViewListener, ReducedGraph<G,V,E>

public class ReducedGraphImpl<G extends Graph<V,E>,V,E extends Edge<V>>
extends AbstractDerivedGraph<NodeReducedData,Edge<NodeReducedData>,G,V,E>
implements ReducedGraph<G,V,E>

Implementation of the Reduced Graph.

Author:

Cecile Menahem, Aurelien Naldi

Field Summary

Fields

Modifier and Type	Field and Description
static String	GRAPH_ZIP_NAME

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

associatedGraph, associatedID

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

attributes, graphAnnotation, graphName, ZIP_PREFIX

Constructor Summary

Constructors

Constructor and Description
ReducedGraphImpl()
ReducedGraphImpl(G parent)
ReducedGraphImpl(Set set, File file)

Method Summary

Modifier and Type	Method and Description
Edge<NodeReducedData>	addEdge(NodeReducedData source, NodeReducedData target) add an edge to this graph.
protected List	doMerge(Graph otherGraph) Specialized method that execute the merging of the given graph with the current one Must be override at specialized graph level
protected GINMLWriter	getGINMLWriter()
String	getGraphZipName() Return the zip extension for the graph type
int	getNodeOrderSize() Return 0 since no node order is defined on this king of graph
Set<String>	getSelectedSet(Collection<NodeReducedData> selection)
Graph	getSubgraph(Collection vertex, Collection 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
protected boolean	isAssociationValid(Graph<?,?> graph) Indicates if the given graph can be associated to the current one

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

getAssociatedGraph, getAssociatedGraphID, graphChanged, setAssociatedGraph, setAssociatedGraphID

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

addEdge, addNode, addViewListener, containsEdge, containsNode, copyView, damage, doSave, fireGraphChange, fireMetaChange, getAnnotation, getAttributes, getCachedEdgeAttributeReader, getCachedNodeAttributeReader, getDimension, getDisplayName, getEdge, getEdgeAttributeReader, getEdges, getExistingNode, getGraphName, 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, containsNode, getAnnotation, getEdge, getEdges, getExistingNode, getGraphName, getIncomingEdges, getNodeByName, getNodeCount, getNodes, getOutgoingEdges, getShortestPath, getStronglyConnectedComponents, merge, removeEdge, removeNode, searchNodes, setGraphName

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

getAssociatedGraph, getAssociatedGraphID, setAssociatedGraph, setAssociatedGraphID

Field Detail

GRAPH_ZIP_NAME

public static final String GRAPH_ZIP_NAME

See Also:

Constant Field Values

Constructor Detail

ReducedGraphImpl

public ReducedGraphImpl(G parent)

Parameters:

parent -

ReducedGraphImpl

public ReducedGraphImpl(Set set,
                        File file)
                 throws GsException

Parameters:

set -

file -

Throws:

GsException

ReducedGraphImpl

public ReducedGraphImpl()

Method Detail

getGraphZipName

public String getGraphZipName()

Return the zip extension for the graph type

Overrides:

getGraphZipName in class AbstractGraph<NodeReducedData,Edge<NodeReducedData>>

Returns:

the zip extension for the graph type

getNodeOrderSize

public int getNodeOrderSize()

Return 0 since no node order is defined on this king of graph

Specified by:

getNodeOrderSize in interface GraphModel<NodeReducedData,Edge<NodeReducedData>>

Specified by:

getNodeOrderSize in class AbstractGraph<NodeReducedData,Edge<NodeReducedData>>

Returns:

0 since no node order is defined on this king of graph

isAssociationValid

protected boolean isAssociationValid(Graph<?,?> graph)

Indicates if the given graph can be associated to the current one

Specified by:

isAssociationValid in class AbstractDerivedGraph<NodeReducedData,Edge<NodeReducedData>,G extends Graph<V,E>,V,E extends Edge<V>>

Parameters:

graph - the graph to associate to the current one

Returns:

true is association is possible, false if not

getGINMLWriter

protected GINMLWriter getGINMLWriter()

Overrides:

getGINMLWriter in class AbstractGraph<NodeReducedData,Edge<NodeReducedData>>

addEdge

public Edge<NodeReducedData> addEdge(NodeReducedData source,
                                     NodeReducedData target)

add an edge to this graph.

Specified by:

addEdge in interface ReducedGraph<G extends Graph<V,E>,V,E extends Edge<V>>

Parameters:

source - source node of this edge.

target - target node of this edge.

doMerge

protected List doMerge(Graph otherGraph)

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<NodeReducedData,Edge<NodeReducedData>>

Returns:

getSubgraph

public Graph getSubgraph(Collection vertex,
                         Collection 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<NodeReducedData,Edge<NodeReducedData>>

Specified by:

getSubgraph in class AbstractGraph<NodeReducedData,Edge<NodeReducedData>>

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

getSelectedSet

public Set<String> getSelectedSet(Collection<NodeReducedData> selection)

Specified by:

getSelectedSet in interface ReducedGraph<G extends Graph<V,E>,V,E extends Edge<V>>

Returns:

a map referencing all real nodes in the selected CC