final class Graph[V, E] extends DatatypeSig

Annotations
@datatype()
Linear Supertypes
DatatypeSig, DatatypeMarker, Immutable, ImmutableMarker, Clonable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Graph
  2. DatatypeSig
  3. DatatypeMarker
  4. Immutable
  5. ImmutableMarker
  6. Clonable
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Graph(__nodes: HashMap[V, Index], __nodesInverse: IS[Index, V], __incomingEdges: HashMap[Index, Edges[E]], __outgoingEdges: HashMap[Index, Edges[E]], __nextNodeId: Index, __multi: B)

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def $cannotMixImmutableAndMutable: Nothing
    Attributes
    protected
    Definition Classes
    Immutable
  4. def $clone: ImmutableMarker
    Definition Classes
    ImmutableMarker → Clonable
  5. lazy val $content: Seq[(java.lang.String, Any)]
    Definition Classes
    Graph → DatatypeSig
  6. def $hasEquals: Boolean
    Attributes
    protected
    Definition Classes
    Immutable
  7. def $hasString: Boolean
    Attributes
    protected
    Definition Classes
    Immutable
  8. def *(node: V): Graph[V, E]
    Annotations
    @pure()
  9. def +(edge: (V, V)): Graph[V, E]
    Annotations
    @pure()
  10. def +@(edge: ((V, V), E)): Graph[V, E]
    Annotations
    @pure()
  11. def -(edge: Edge[V, E]): Graph[V, E]
    Annotations
    @pure()
  12. def -#(p: (Edge[V, E], Z)): Graph[V, E]
    Annotations
    @pure()
  13. def --[I](edges: IS[I, Edge[V, E]]): Graph[V, E]
    Annotations
    @pure()
  14. def --*[I](ns: IS[I, V]): Graph[V, E]
    Annotations
    @pure()
  15. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  16. def addDataEdge(data: E, source: V, dest: V): Graph[V, E]
    Annotations
    @pure()
  17. def addEdge(edge: Edge[V, E]): Graph[V, E]
    Annotations
    @pure()
  18. def addPlainEdge(source: V, dest: V): Graph[V, E]
    Annotations
    @pure()
  19. def allEdges: sireum.ISZ[Edge[V, E]]
    Annotations
    @pure()
  20. def apply(nodes: HashMap[V, Index] = ..., nodesInverse: IS[Index, V] = ..., incomingEdges: HashMap[Index, Edges[E]] = ..., outgoingEdges: HashMap[Index, Edges[E]] = ..., nextNodeId: Index = ..., multi: B = ...): Graph[V, E]
  21. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  22. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  23. def edges(source: V, dest: V): sireum.ISZ[Edge[V, E]]
    Annotations
    @pure()
  24. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  25. def equals(o: Any): Boolean
    Definition Classes
    Graph → AnyRef → Any
  26. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  27. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  28. def getIncomingEdges: HashMap[Index, Edges[E]]
  29. def getMulti: B
  30. def getNextNodeId: Index
  31. def getNodes: HashMap[V, Index]
  32. def getNodesInverse: IS[Index, V]
  33. def getOutgoingEdges: HashMap[Index, Edges[E]]
  34. def hash: Z
    Definition Classes
    Graph → DatatypeSig
    Annotations
    @pure()
  35. lazy val hashCode: Int
    Definition Classes
    Graph → AnyRef → Any
  36. def incoming(dest: V): sireum.ISZ[Edge[V, E]]
    Annotations
    @pure()
  37. def incomingEdges: HashMap[Index, Edges[E]]
  38. def isEqual(other: Graph[V, E]): B
    Annotations
    @pure()
  39. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  40. def multi: B
  41. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  42. def nextNodeId: Index
  43. def nodes: HashMap[V, Index]
  44. def nodesInverse: IS[Index, V]
  45. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  46. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  47. def numOfEdges: Z
    Annotations
    @pure()
  48. def numOfNodes: Z
    Annotations
    @pure()
  49. def outgoing(source: V): sireum.ISZ[Edge[V, E]]
    Annotations
    @pure()
  50. def outgoingEdges: HashMap[Index, Edges[E]]
  51. def removeEdgeN(edge: Edge[V, E], n: Z): Graph[V, E]
    Annotations
    @pure()
  52. def string: String
    Definition Classes
    Graph → DatatypeSig → Immutable
    Annotations
    @pure()
  53. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  54. def toST(f: (V) ⇒ ST, g: (E) ⇒ ST): ST
    Annotations
    @pure()
  55. def toString(): java.lang.String
    Definition Classes
    Graph → AnyRef → Any
  56. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  57. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  58. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )

Inherited from DatatypeSig

Inherited from DatatypeMarker

Inherited from Immutable

Inherited from ImmutableMarker

Inherited from Clonable

Inherited from AnyRef

Inherited from Any

Ungrouped