axle.graph

JungUndirectedGraph

case class JungUndirectedGraph[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. JungUndirectedGraph
  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 JungUndirectedGraph(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
    JungUndirectedGraph → UndirectedGraph

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

    Definition Classes
    JungUndirectedGraph → 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. def allEdges(): Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  7. def areNeighbors(v1: Vertex[VP], v2: Vertex[VP]): Boolean

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  9. def clone(): AnyRef

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

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

    Definition Classes
    UndirectedGraph

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

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  12. def delete(v: Vertex[VP]): JungUndirectedGraph[VP, EP]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

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

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

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

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

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

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

  17. def eliminate(v: Vertex[VP], payload: (Vertex[VP], Vertex[VP]) ⇒ EP): JungUndirectedGraph[VP, EP]

    "decompositions" page 3 (Definition 3, Section 9.

    "decompositions" page 3 (Definition 3, Section 9.3) turn the neighbors of v into a clique

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

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

    Definition Classes
    AnyRef

  19. def filterEdges(f: ((Vertex[VP], Vertex[VP], EP)) ⇒ Boolean): JungUndirectedGraph[VP, EP]

  20. def finalize(): Unit

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

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

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

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

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

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

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

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

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    UndirectedGraph

  26. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  27. lazy val jungGraph: UndirectedSparseGraph[Vertex[VP], Edge[(Vertex[VP], Vertex[VP], EP), EP]]

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

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

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

    Definition Classes
    AnyRef

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

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  31. final def notify(): Unit

    Definition Classes
    AnyRef

  32. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    UndirectedGraph

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

    Definition Classes
    UndirectedGraph

  35. def size(): Int

  36. def storage(): UndirectedSparseGraph[Vertex[VP], Edge[(Vertex[VP], Vertex[VP], EP), EP]]

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

    Definition Classes
    AnyRef

  38. def unlink(v1: Vertex[VP], v2: Vertex[VP]): JungUndirectedGraph[VP, EP]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  39. def unlink(e: Edge[(Vertex[VP], Vertex[VP], EP), EP]): JungUndirectedGraph[VP, EP]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  40. def vertexPayloads(): Seq[VP]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  41. lazy val vertexSeq: Seq[Vertex[VP]]

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

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

    Definition Classes
    UndirectedGraph

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

    Definition Classes
    UndirectedGraph

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

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

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

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  47. val vps: Seq[VP]

  48. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  50. 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