axle.graph

NativeUndirectedGraph

case class NativeUndirectedGraph [VP, EP] (vps: Seq[VP], ef: (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)]) extends UndirectedGraph[VP, EP] with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, UndirectedGraph[VP, EP], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. NativeUndirectedGraph
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. UndirectedGraph
  7. AnyRef
  8. Any
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NativeUndirectedGraph (vps: Seq[VP], ef: (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)])

Type Members

  1. type ES = (Vertex[VP], Vertex[VP], EP)

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  2. type G [VP, EP] = NativeUndirectedGraph[VP, EP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

Value Members

  1. def != (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  2. def != (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  3. def ## (): Int

    Attributes
    final
    Definition Classes
    AnyRef → Any

  4. def == (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  5. def == (arg0: Any): Boolean

    Attributes
    final
    Definition Classes
    Any

  6. val _edges : Seq[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

  7. val _vertices : Seq[Vertex[VP]]

  8. def allEdges (): Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  9. def areNeighbors (vi: Vertex[VP], vj: Vertex[VP]): Boolean

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  10. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  11. def canEqual (arg0: Any): Boolean

    Definition Classes
    NativeUndirectedGraph → Equals

  12. def clone (): AnyRef

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

  13. def connects (edge: Edge[(), EP], a1: Vertex[VP], a2: Vertex[VP]): Boolean

    Definition Classes
    UndirectedGraph

  14. def degree (v: Vertex[VP]): Int

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  15. def delete (v: Vertex[VP]): NativeUndirectedGraph[VP, EP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  16. val edgePayloadFunction : (()) ⇒ EP

  17. lazy val edgeSet : Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

  18. def edgesTouching (v: Vertex[VP]): Set[Edge[(), EP]]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  19. val ef : (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)]

  20. def eliminate (v: Vertex[VP], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): NativeUndirectedGraph[VP, EP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  21. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  22. def equals (arg0: Any): Boolean

    Definition Classes
    NativeUndirectedGraph → Equals → AnyRef → Any

  23. def filterEdges (f: ((Vertex[VP], Vertex[VP], EP)) ⇒ Boolean): NativeUndirectedGraph[VP, EP]

  24. def finalize (): Unit

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

  25. def findEdge (vi: Vertex[VP], vj: Vertex[VP]): Option[Edge[(), EP]]

  26. def findVertex (f: (Vertex[VP]) ⇒ Boolean): Option[Vertex[VP]]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  27. def firstLeafOtherThan (r: Vertex[VP]): Option[Vertex[VP]]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  28. def forceClique (among: Set[Vertex[VP]], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): NativeUndirectedGraph[VP, EP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  29. def getClass (): java.lang.Class[_]

    Attributes
    final
    Definition Classes
    AnyRef → Any

  30. def hashCode (): Int

    Definition Classes
    NativeUndirectedGraph → AnyRef → Any

  31. def isClique (vs: IndexedSeq[Vertex[VP]]): Boolean

  32. def isClique (vs: GenTraversable[Vertex[VP]]): Boolean

    Definition Classes
    UndirectedGraph

  33. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  34. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  35. def neighbors (v: Vertex[VP]): Set[Vertex[VP]]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  36. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  37. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  38. def numEdgesToForceClique (vs: GenTraversable[Vertex[VP]], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): Int

    Definition Classes
    UndirectedGraph

  39. def other (edge: Edge[(), EP], u: Vertex[VP]): Vertex[VP]

    Definition Classes
    UndirectedGraph

  40. def productArity : Int

    Definition Classes
    NativeUndirectedGraph → Product

  41. def productElement (arg0: Int): Any

    Definition Classes
    NativeUndirectedGraph → Product

  42. def productIterator : Iterator[Any]

    Definition Classes
    Product

  43. def productPrefix : String

    Definition Classes
    NativeUndirectedGraph → Product

  44. def size (): Int

  45. def storage (): (Seq[Vertex[VP]], Seq[Edge[(Vertex[VP], Vertex[VP], EP), EP]], Map[Vertex[VP], Set[Edge[(), EP]]])

  46. def synchronized [T0] (arg0: ⇒ T0): T0

    Attributes
    final
    Definition Classes
    AnyRef

  47. def toString (): String

    Definition Classes
    NativeUndirectedGraph → AnyRef → Any

  48. def unlink (vi: Vertex[VP], vj: Vertex[VP]): NativeUndirectedGraph[VP, EP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  49. def unlink (e: Edge[(), EP]): NativeUndirectedGraph[VP, EP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  50. lazy val vertex2edges : Map[Vertex[VP], Set[Edge[(), EP]]]

  51. lazy val vertexSet : Set[Vertex[VP]]

  52. def vertexWithFewestEdgesToEliminateAmong (among: Set[Vertex[VP]], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): Vertex[VP]

    Definition Classes
    UndirectedGraph

  53. def vertexWithFewestNeighborsAmong (among: Set[Vertex[VP]]): Vertex[VP]

    Definition Classes
    UndirectedGraph

  54. def vertices (edge: Edge[(), EP]): (Vertex[VP], Vertex[VP])

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  55. def vertices (): Set[Vertex[VP]]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  56. val vps : Seq[VP]

  57. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  59. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

Deprecated Value Members

  1. def productElements : Iterator[Any]

    Definition Classes
    Product
    Annotations
    @deprecated
    Deprecated

    use productIterator instead

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from UndirectedGraph[VP, EP]

Inherited from AnyRef

Inherited from Any