public class IntegerHierarchicalGraphImpl extends Object implements IntegerHierarchicalGraph
Constructor and Description |
---|
IntegerHierarchicalGraphImpl(Integer bottom,
Integer top)
Constructs an empty hierarchical graph.
|
IntegerHierarchicalGraphImpl(IntegerSubsumerGraph origGraph)
Constructs a hierarchical graph using another graph.
|
Modifier and Type | Method and Description |
---|---|
void |
disjointUnion(IntegerHierarchicalGraph otherGraph)
Makes a disjoint union with another graph.
|
boolean |
equals(Object o) |
Set<Integer> |
getAncestors(Integer orig)
Returns all predecessors of a particular given vertex.
|
Integer |
getBottomElement()
Returns the bottom element.
|
Set<Integer> |
getChildren(Integer elem)
Returns all direct successors of a particular given vertex.
|
Set<Integer> |
getDescendants(Integer orig)
Returns all successors of a particular given vertex.
|
Set<Integer> |
getElements()
Returns all the vertices in the graph.
|
Set<Integer> |
getEquivalents(Integer elem)
Returns all vertices that are in a cycle for a given vertex and the
vertex itself.
|
Set<Integer> |
getNonEquivalentElements()
Returns one vertex for each equivalence class of vertices in the graph.
|
Set<Integer> |
getParents(Integer elem)
Returns all direct predecessors of a particular given vertex.
|
Integer |
getTopElement()
Returns the top element.
|
int |
hashCode() |
String |
toString() |
public IntegerHierarchicalGraphImpl(Integer bottom, Integer top)
bottom
- bottom class identifiertop
- top class identifierpublic IntegerHierarchicalGraphImpl(IntegerSubsumerGraph origGraph)
origGraph
- a subsumer graphpublic void disjointUnion(IntegerHierarchicalGraph otherGraph)
otherGraph
- other graph to make the unionpublic Set<Integer> getAncestors(Integer orig)
IntegerHierarchicalGraph
getAncestors
in interface IntegerHierarchicalGraph
orig
- starting vertexpublic Integer getBottomElement()
IntegerHierarchicalGraph
getBottomElement
in interface IntegerHierarchicalGraph
public Set<Integer> getChildren(Integer elem)
IntegerHierarchicalGraph
getChildren
in interface IntegerHierarchicalGraph
elem
- starting vertexpublic Set<Integer> getDescendants(Integer orig)
IntegerHierarchicalGraph
getDescendants
in interface IntegerHierarchicalGraph
orig
- starting vertexpublic Set<Integer> getElements()
IntegerHierarchicalGraph
getElements
in interface IntegerHierarchicalGraph
public Set<Integer> getEquivalents(Integer elem)
IntegerHierarchicalGraph
getEquivalents
in interface IntegerHierarchicalGraph
elem
- starting vertexpublic Set<Integer> getNonEquivalentElements()
public Set<Integer> getParents(Integer elem)
IntegerHierarchicalGraph
getParents
in interface IntegerHierarchicalGraph
elem
- starting vertexpublic Integer getTopElement()
IntegerHierarchicalGraph
getTopElement
in interface IntegerHierarchicalGraph
Copyright © 2009–2015 Chair of Automata Theory - TU Dresden. All rights reserved.