axle.graph

NativeUndirectedGraph

case class NativeUndirectedGraph[VP, EP](vps: Seq[VP], ef: (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)])(implicit evidence$1: Manifest[VP]) 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. NativeUndirectedGraph
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. UndirectedGraph
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

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. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    AnyRef

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

    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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  11. def clone(): AnyRef

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

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

    Definition Classes
    UndirectedGraph

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  15. def edgeFunction(): (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  16. val edgePayloadFunction: ((Vertex[VP], Vertex[VP], EP)) ⇒ EP

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

  18. def edgesTouching(v: Vertex[VP]): Set[Edge[(Vertex[VP], Vertex[VP], EP), 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. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

  23. def finalize(): Unit

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

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

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

    Definition Classes
    AnyRef → Any

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

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

    Definition Classes
    UndirectedGraph

  31. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  32. def map[NVP, NEP](vpf: (VP) ⇒ NVP, epf: (EP) ⇒ NEP)(implicit arg0: Manifest[NVP]): NativeUndirectedGraph[NVP, NEP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

    Definition Classes
    AnyRef

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  35. final def notify(): Unit

    Definition Classes
    AnyRef

  36. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    UndirectedGraph

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

    Definition Classes
    UndirectedGraph

  39. def size(): Int

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

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

    Definition Classes
    AnyRef

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

  45. def vertexPayloads(): Seq[VP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

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

    Definition Classes
    UndirectedGraph

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

    Definition Classes
    UndirectedGraph

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  51. val vps: Seq[VP]

  52. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from UndirectedGraph[VP, EP]

Inherited from AnyRef

Inherited from Any

Ungrouped