axle.graph.JungUndirectedGraphFactory

JungUndirectedGraph

trait JungUndirectedGraph [VP, EP] extends UndirectedGraph[VP, EP]

Linear Supertypes
UndirectedGraph[VP, EP], Graph[VP, EP], AnyRef, Any
Known Subclasses
EliminationTree, InteractionGraph, JoinTree
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. Hide All
  2. Show all
  1. JungUndirectedGraph
  2. UndirectedGraph
  3. Graph
  4. AnyRef
  5. Any
Visibility
  1. Public
  2. All

Type Members

  1. type E = JungUndirectedGraphEdge[EP]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph → Graph

  2. trait GraphEdge [P] extends AnyRef

  3. trait GraphVertex [P] extends AnyRef

  4. trait JungUndirectedGraphEdge [P] extends UndirectedGraphEdge[P]

  5. class JungUndirectedGraphEdgeImpl extends JungUndirectedGraphEdge[EP]

  6. trait JungUndirectedGraphVertex [P] extends UndirectedGraphVertex[P]

  7. class JungUndirectedGraphVertexImpl extends JungUndirectedGraphVertex[VP]

  8. type S = UndirectedSparseGraph[V, E]

    Definition Classes
    JungUndirectedGraph → Graph

  9. trait UndirectedGraphEdge [P] extends GraphEdge[P]

  10. trait UndirectedGraphVertex [P] extends GraphVertex[P]

  11. type V = JungUndirectedGraphVertex[VP]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph → Graph

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 ++= (vps: Seq[VP]): Seq[V]

    Definition Classes
    Graph

  5. def += (vp: VP): V

    Definition Classes
    Graph

  6. def += (vs: (V, V), ep: EP): E

    Definition Classes
    Graph

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

    Attributes
    final
    Definition Classes
    AnyRef

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

    Attributes
    final
    Definition Classes
    Any

  9. def areNeighbors (v1: V, v2: V): Boolean

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  10. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  11. def clone (): AnyRef

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

  12. def degree (v: V): Int

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  13. def delete (v: V): Unit

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  14. def edge (v1: V, v2: V, payload: EP): JungUndirectedGraphEdge[EP]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph → Graph

  15. def edges (v: V): Set[E]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  16. def edges (): Set[E]

    Definition Classes
    JungUndirectedGraph → Graph

  17. def eliminate (vs: List[V], payload: (V, V) ⇒ EP): Unit

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  18. def eliminate (v: V, payload: (V, V) ⇒ EP): Unit

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  19. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  20. def equals (arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  21. def finalize (): Unit

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

  22. def findVertex (payload: VP): Option[V]

  23. def firstLeafOtherThan (r: V): Option[V]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  24. def forceClique (vs: Set[V], payload: (V, V) ⇒ EP): Unit

    Definition Classes
    UndirectedGraph

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

    Attributes
    final
    Definition Classes
    AnyRef → Any

  26. def hashCode (): Int

    Definition Classes
    AnyRef → Any

  27. def isClique (vs: Set[V]): Boolean

    Definition Classes
    UndirectedGraph

  28. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  29. val jungGraph : UndirectedSparseGraph[V, E]

  30. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  31. def neighbors (v: V): Set[V]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  32. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  33. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  34. def numEdgesToForceClique (vs: Set[V], payload: (V, V) ⇒ EP): Int

    Definition Classes
    UndirectedGraph

  35. def size (): Int

    Definition Classes
    JungUndirectedGraph → Graph

  36. def storage (): UndirectedSparseGraph[V, E]

    Definition Classes
    JungUndirectedGraph → Graph

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

    Attributes
    final
    Definition Classes
    AnyRef

  38. def toString (): String

    Definition Classes
    AnyRef → Any

  39. def unlink (v1: V, v2: V): Unit

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  40. def unlink (e: E): Unit

    Definition Classes
    JungUndirectedGraph → UndirectedGraph

  41. def vertex (payload: VP): JungUndirectedGraphVertex[VP]

    Definition Classes
    JungUndirectedGraph → UndirectedGraph → Graph

  42. def vertexWithFewestEdgesToEliminateAmong (among: Set[V], payload: (V, V) ⇒ EP): V

    Definition Classes
    UndirectedGraph

  43. def vertexWithFewestNeighborsAmong (among: Set[V]): V

    Definition Classes
    UndirectedGraph

  44. def vertices (): Set[V]

    Definition Classes
    JungUndirectedGraph → Graph

  45. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  47. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from UndirectedGraph[VP, EP]

Inherited from Graph[VP, EP]

Inherited from AnyRef

Inherited from Any