axle.graph.UndirectedGraphFactory

UndirectedGraph

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

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

Type Members

  1. type E <: UndirectedGraphEdge[EP]

    Attributes
    abstract
    Definition Classes
    UndirectedGraphGraph
  2. trait GraphEdge [P] extends AnyRef

  3. trait GraphVertex [P] extends AnyRef

  4. type S

    Attributes
    abstract
    Definition Classes
    Graph
  5. trait UndirectedGraphEdge [P] extends GraphEdge[P]

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

  7. type V <: UndirectedGraphVertex[VP]

    Attributes
    abstract
    Definition Classes
    UndirectedGraphGraph

Abstract Value Members

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

    Attributes
    abstract
  2. def degree (v: V): Int

    Attributes
    abstract
  3. def delete (v: V): Unit

    Attributes
    abstract
  4. def edge (v1: V, v2: V, payload: EP): E

    Attributes
    abstract
    Definition Classes
    UndirectedGraphGraph
  5. def edges (v: V): Set[E]

    Attributes
    abstract
  6. def edges (): Set[E]

    Attributes
    abstract
    Definition Classes
    Graph
  7. def eliminate (vs: List[V], payload: (V, V) ⇒ EP): Unit

    Attributes
    abstract
  8. def eliminate (v: V, payload: (V, V) ⇒ EP): Unit

    Attributes
    abstract
  9. def firstLeafOtherThan (r: V): Option[V]

    Attributes
    abstract
  10. def neighbors (v: V): Set[V]

    Attributes
    abstract
  11. def size (): Int

    Attributes
    abstract
    Definition Classes
    Graph
  12. def storage : S

    Attributes
    abstract
    Definition Classes
    Graph
  13. def unlink (v1: V, v2: V): Unit

    Attributes
    abstract
  14. def unlink (e: E): Unit

    Attributes
    abstract
  15. def vertex (payload: VP): V

    Attributes
    abstract
    Definition Classes
    UndirectedGraphGraph
  16. def vertices (): Set[V]

    Attributes
    abstract
    Definition Classes
    Graph

Concrete 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 asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any
  10. def clone (): AnyRef

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  11. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  12. def equals (arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  13. def finalize (): Unit

    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  14. def forceClique (vs: Set[V], payload: (V, V) ⇒ EP): Unit

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

    Attributes
    final
    Definition Classes
    AnyRef → Any
  16. def hashCode (): Int

    Definition Classes
    AnyRef → Any
  17. def isClique (vs: Set[V]): Boolean

  18. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any
  19. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef
  20. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
  21. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
  22. def numEdgesToForceClique (vs: Set[V], payload: (V, V) ⇒ EP): Int

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

    Attributes
    final
    Definition Classes
    AnyRef
  24. def toString (): String

    Definition Classes
    AnyRef → Any
  25. def vertexWithFewestEdgesToEliminateAmong (among: Set[V], payload: (V, V) ⇒ EP): V

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

  27. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  28. def wait (arg0: Long, arg1: Int): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()
  29. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from Graph[VP, EP]

Inherited from AnyRef

Inherited from Any