Package de.saar.chorus.domgraph.chart
Class Split<E>
java.lang.Object
de.saar.chorus.domgraph.chart.Split<E>
A split in a dominance chart. A split of a subgraph is
induced by the choice of a certain free fragment as the root
of a solved form of this subgraph. It also records the
weakly connected components into which the subgraph is split
by removing the free fragment, and to which hole of the
fragment the nodes of each WCC are connected.
- Author:
- Alexander Koller
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionvoidAdds a weakly connected component to a split representation.booleanReturns the set of holes of the root fragment which are connected to any wcc.Returns the set of WCCs into which the subgraph is split by removing the root fragment.Returns the root fragment of this split.Returns the set of weakly connected components which are connected to the specified node.inthashCode()voidsetSubstitution(Map<String, String> subst) toString()
-
Constructor Details
-
Split
Creates a split with a given root fragment.- Parameters:
rootFragment- the root fragment of this split
-
-
Method Details
-
addWcc
Adds a weakly connected component to a split representation.- Parameters:
hole- the hole of the free fragment to which the wcc is connectedwcc- a weakly connected component of the subgraph
-
getRootFragment
Returns the root fragment of this split.- Returns:
- the root fragment
-
getWccs
Returns the set of weakly connected components which are connected to the specified node.- Parameters:
node- a node of the root fragment- Returns:
- the list of wccs connected to this node, or
nullif no wccs are connected to it.
-
getAllDominators
Returns the set of holes of the root fragment which are connected to any wcc.- Returns:
- the set of holes
-
getAllSubgraphs
Returns the set of WCCs into which the subgraph is split by removing the root fragment.- Returns:
- the set of wccs
-
toString
-
getSubstitution
-
setSubstitution
-
hashCode
public int hashCode() -
equals
-