|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.processmining.framework.models.petrinet.PetriNetNavigation
public class PetriNetNavigation
Title: PetriNetNavigation
Description: A toolbox for navigating a Petri net.
Copyright: Copyright (c) 2006
Company: University of Aarhus
Constructor Summary | |
---|---|
PetriNetNavigation()
|
Method Summary | |
---|---|
static java.util.LinkedList<att.grappa.Node> |
getIncomingNodes(att.grappa.Node node)
Returns all nodes that has an arc to the input node |
static java.util.LinkedList<att.grappa.Node> |
getIncomingNodesOfIncomingNodes(att.grappa.Node aNode)
Returns all nodes that can reach the input node in two steps |
static java.util.Vector<Place> |
getIncomingPlaces(att.grappa.Node n)
|
static java.util.List<Transition> |
getIncomingTransitions(att.grappa.Node n)
|
static java.util.LinkedList<att.grappa.Node> |
getOutgoingNodes(att.grappa.Node node)
Returns all nodes that has an arc from the output node |
static java.util.LinkedList<att.grappa.Node> |
getOutgoingNodesOfOutgoingNodes(att.grappa.Node aNode)
Returns the all nodes that can be reached in two steps from the input node |
static java.util.Vector<Place> |
getOutgoingPlaces(att.grappa.Node n)
|
static java.util.Vector<Transition> |
getOutgoingTransitions(att.grappa.Node n)
|
static Transition |
getTransition(att.grappa.Edge arc)
Returns the transition end of the input arc |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public PetriNetNavigation()
Method Detail |
---|
public static java.util.LinkedList<att.grappa.Node> getIncomingNodes(att.grappa.Node node)
node
- -
A node
public static java.util.LinkedList<att.grappa.Node> getIncomingNodesOfIncomingNodes(att.grappa.Node aNode)
aNode
- -
A node
public static java.util.LinkedList<att.grappa.Node> getOutgoingNodes(att.grappa.Node node)
node
- -
A node
public static java.util.LinkedList<att.grappa.Node> getOutgoingNodesOfOutgoingNodes(att.grappa.Node aNode)
aNode
- -
A node
public static java.util.Vector<Place> getOutgoingPlaces(att.grappa.Node n)
getOutgoingNodes(Node)
public static java.util.Vector<Place> getIncomingPlaces(att.grappa.Node n)
getIncomingNodes(Node)
public static java.util.Vector<Transition> getOutgoingTransitions(att.grappa.Node n)
getOutgoingNodes(Node)
public static java.util.List<Transition> getIncomingTransitions(att.grappa.Node n)
getIncomingNodes(Node)
public static Transition getTransition(att.grappa.Edge arc)
arc
- -
An arc
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |