Class

com.ing.baker.petrinet.api

ScalaGraphPetriNet

Related Doc: package api

Permalink

case class ScalaGraphPetriNet[P, T](innerGraph: BiPartiteGraph[P, T, WLDiEdge]) extends PetriNet[P, T] with Product with Serializable

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

Linear Supertypes
Serializable, Serializable, Product, Equals, PetriNet[P, T], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ScalaGraphPetriNet
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. PetriNet
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new ScalaGraphPetriNet(innerGraph: BiPartiteGraph[P, T, WLDiEdge])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  8. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  9. def inMarking(t: T): MultiSet[P]

    Permalink

    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

  10. def incomingPlaces(t: T): Set[P]

    Permalink

    The in-adjacent places of a transition.

    The in-adjacent places of a transition.

    t

    transition

    Definition Classes
    ScalaGraphPetriNet → PetriNet

  11. def incomingTransitions(p: P): Set[T]

    Permalink

    The in-adjacent transitions of a place.

    The in-adjacent transitions of a place.

    p

    place

    Definition Classes
    ScalaGraphPetriNet → PetriNet

  12. val innerGraph: BiPartiteGraph[P, T, WLDiEdge]

    Permalink

    The scala-graph backing petri net.

    The scala-graph backing petri net.

    Definition Classes
    ScalaGraphPetriNet → PetriNet

  13. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  14. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  15. def nodes: Set[Either[P, T]]

    Permalink

    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

  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. def outMarking(t: T): MultiSet[P]

    Permalink

    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

  19. def outgoingPlaces(t: T): Set[P]

    Permalink

    The out-adjecent places of a transition.

    The out-adjecent places of a transition.

    t

    transition

    Definition Classes
    ScalaGraphPetriNet → PetriNet

  20. def outgoingTransitions(p: P): Set[T]

    Permalink

    The out-adjacent transitions of a place.

    The out-adjacent transitions of a place.

    p

    place

    Definition Classes
    ScalaGraphPetriNet → PetriNet

  21. lazy val places: Set[P]

    Permalink

    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

  22. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  23. lazy val transitions: Set[T]

    Permalink

    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

  24. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  25. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  26. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from PetriNet[P, T]

Inherited from AnyRef

Inherited from Any

Ungrouped