class ScalaGraphPetriNet[P, T] extends PetriNet[P, T]
TODO; can we remove this wrapper? It seems only needed because we need to mix in other traits with PetriNet which cannot be done with Graph.apply
- Alphabetic
- By Inheritance
- ScalaGraphPetriNet
- PetriNet
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new ScalaGraphPetriNet(innerGraph: BiPartiteGraph[P, T, WLDiEdge])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
def
inMarking(t: T): MultiSet[P]
Returns the in-marking of a transition.
Returns the in-marking of a transition. That is; a map of place -> arc weight
- t
transition
- Definition Classes
- ScalaGraphPetriNet → PetriNet
-
def
incomingPlaces(t: T): Set[P]
The in-adjacent places of a transition.
-
def
incomingTransitions(p: P): Set[T]
The in-adjacent transitions of a place.
-
val
innerGraph: BiPartiteGraph[P, T, WLDiEdge]
- Definition Classes
- ScalaGraphPetriNet → PetriNet
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
leavePlaces: Set[P]
Returns all places that are leaves (have no outgoing transitions)
Returns all places that are leaves (have no outgoing transitions)
- Definition Classes
- PetriNet
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
nodes: Set[Either[P, T]]
The set of nodes (places + transitions) in the petri net.
The set of nodes (places + transitions) in the petri net.
- returns
The set of nodes.
- Definition Classes
- ScalaGraphPetriNet → PetriNet
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
outMarking(t: T): MultiSet[P]
The out marking of a transition.
The out marking of a transition. That is; a map of place -> arc weight
- t
transition
- Definition Classes
- ScalaGraphPetriNet → PetriNet
-
def
outgoingPlaces(t: T): Set[P]
The out-adjecent places of a transition.
The out-adjecent places of a transition.
- t
transition
- Definition Classes
- ScalaGraphPetriNet → PetriNet
-
def
outgoingTransitions(p: P): Set[T]
The out-adjacent transitions of a place.
-
lazy val
places: Set[P]
The set of places of the petri net
The set of places of the petri net
- returns
The set of places
- Definition Classes
- ScalaGraphPetriNet → PetriNet
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
lazy val
transitions: Set[T]
The set of transitions of the petri net
The set of transitions of the petri net
- returns
The set of transitions.
- Definition Classes
- ScalaGraphPetriNet → PetriNet
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )