Package | Description |
---|---|
de.uni_due.inf.ti.raven.data |
Classes to create, represent, manipulate data.
|
de.uni_due.inf.ti.raven.data.automata |
Classes to create, represent, manipulate automata.
|
de.uni_due.inf.ti.raven.encodings |
Classes to encode the state space and the transitions of the various graph automata.
|
de.uni_due.inf.ti.raven.gui |
GUI Classes.
|
Modifier and Type | Method and Description |
---|---|
Node |
Cospan.getInnerInterfaceNode(int i)
Returns the
i -th node of the inner interface of this cospan. |
Node |
Permutation.getNode(int index)
Returns the
index -th node of this permutation |
Node |
Cospan.getNode(String nodeName)
Returns the node with the name
nodeName or null if no
node with the given name is existing. |
Node |
Graph.getNode(String nodeName)
Returns the node with the name
nodeName or null if no
node with the given name is existing. |
Node |
Cospan.getOuterInterfaceNode(int i)
Returns the
i -th node of the outer interface of this cospan. |
Modifier and Type | Method and Description |
---|---|
Set<Node> |
Graph.getAdjacentNodes(Node node)
Returns the set of nodes incident to the node
node |
Set<Node> |
Graph.getAdjacentNodes(String nodeName)
Returns the set of nodes adjacent to the node
nodeName |
List<Node> |
Edge.getIncidentNodes()
Returns the sequence of nodes incident to this edge
|
List<Node> |
Cospan.getInnerInterface()
Returns a list of the nodes in the inner interface of this cospan.
|
List<Node> |
CospanDecomposition.getInnerInterface()
Returns a list of the nodes in the inner interface of this decomposition.
|
Set<Node> |
Cospan.getNodes()
Returns the set of nodes of this cospan.
|
Set<Node> |
GraphDecomposition.Bag.getNodes()
Returns the set of nodes contained in this bag.
|
Set<Node> |
Graph.getNodes()
Returns the set of nodes of this graph.
|
List<Node> |
Cospan.getOuterInterface()
Returns a list of the nodes in the outer interface of this cospan.
|
List<Node> |
CospanDecomposition.getOuterInterface()
Returns a list of the nodes in the outer interface of this decomposition.
|
Iterator<Node> |
GraphDecomposition.Bag.iterator() |
Iterator<Node> |
Permutation.iterator() |
Modifier and Type | Method and Description |
---|---|
void |
GraphDecomposition.Bag.addNode(Node node)
Adds a node to this bag.
|
void |
Permutation.addNode(Node node)
Adds a node at the end of this permutation.
|
int |
Node.compareTo(Node node) |
boolean |
Permutation.contains(Node node)
Returns
true if and only if the node node is contained in this permutation. |
boolean |
Graph.contains(Node node)
Returns
true if and only if this graph contains the node node . |
Set<Node> |
Graph.getAdjacentNodes(Node node)
Returns the set of nodes incident to the node
node |
Set<Edge> |
Graph.getIncidentEdges(Node node)
Returns the set of edges incident to the node
node |
int |
Graph.getNumberOfAdjacentNodes(Node node)
Returns the number of nodes adjacent to the node
node |
int |
Permutation.indexOf(Node node)
Returns the index of the node
node or -1 if the node is not contained
in this permutation. |
boolean |
Graph.isAdjacentTo(Node firstNode,
Node secondNode)
Returns
true if and only if the node firstNode is
adjacent to the node secondNode |
void |
Graph.removeNode(Node node)
Removes the node
node from this graph. |
Modifier and Type | Method and Description |
---|---|
void |
Graph.addEdge(String edgeName,
List<Node> incidentNodes)
Adds an unlabeled edge to this graph.
|
void |
Cospan.addEdge(String edgeName,
String label,
List<Node> incidentNodes)
Adds a labeled edge to this cospan.
|
void |
Graph.addEdge(String edgeName,
String label,
List<Node> incidentNodes)
Adds a labeled edge to this graph.
|
void |
GraphDecomposition.Bag.addNodeSet(Set<Node> nodes)
Adds a set of nodes to this bag.
|
Constructor and Description |
---|
Cospan(Graph graph,
List<Node> innerInterface,
List<Node> outerInterface)
Creates a new cospan consisting of the middle graph
graph and the
two interfaces innerInterface and outerInterface . |
Cospan(Graph graph,
List<Node> innerInterface,
List<Node> outerInterface)
Creates a new cospan consisting of the middle graph
graph and the
two interfaces innerInterface and outerInterface . |
Edge(String name,
String label,
List<Node> incidentNodes)
Creates a new edge with name
name , label label and incident nodes incidentNodes . |
Modifier and Type | Method and Description |
---|---|
List<Node> |
SubgraphAutomaton.getNodeOrder()
Returns the node-order which is used for this automaton.
|
Modifier and Type | Method and Description |
---|---|
List<Node> |
SubgraphEncoding.getNodeOrder()
Returns the node order of this encoding.
|
Modifier and Type | Method and Description |
---|---|
static SubgraphEncoding |
SubgraphEncoding.getDefaultEncoding(int maximumInterface,
int innerInterface,
int outerInterface,
Graph subgraph,
List<Node> nodeOrder,
List<Edge> edgeOrder)
Returns the default BDD encoding for a subgraph instance with a
maximum interface size of
maximumInterface and a wanted
subgraph subgraph . |
static SubgraphEncoding |
SubgraphEncoding.getEncoding(int maximumInterface,
int innerInterface,
int outerInterface,
Graph subgraph,
List<Node> nodeOrder,
List<Edge> edgeOrder,
String encodingName)
Returns the BDD encoding for a subgraph instance given by the class name
name with a maximum interface size of maximumInterface and
a wanted subgraph subgraph If no subgraph encoding with the given
name can be found the default encoding is returned. |
Modifier and Type | Method and Description |
---|---|
List<Node> |
NewEdgeDialog.EdgeData.getIncidentNodes()
Returns the incident nodes of the edge.
|
Modifier and Type | Method and Description |
---|---|
static NewEdgeDialog.EdgeData |
NewEdgeDialog.showDialog(Window owner,
Graph graph,
List<Node> presetNodes)
Brings up a new dialog on which the user can enter the name and the label
and select the incident nodes of the new edge.
|
Constructor and Description |
---|
NewEdgeDialog.EdgeData(String name,
String label,
List<Node> incidentNodes)
Creates a new
EdgeData -object containing the name, the label
and the sequence of incident nodes of a new edge. |