axle.graph.NativeUndirectedGraphFactory

NativeUndirectedGraph

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

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

Type Members

  1. type E = NativeUndirectedGraphEdge[EP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph → Graph

  2. trait GraphEdge [P] extends AnyRef

  3. trait GraphVertex [P] extends AnyRef

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

  5. class NativeUndirectedGraphEdgeImpl [P] extends NativeUndirectedGraphEdge[P]

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

  7. class NativeUndirectedGraphVertexImpl [P] extends NativeUndirectedGraphVertex[P]

  8. type S = (Set[V], Set[E], Map[V, Set[E]])

    Definition Classes
    NativeUndirectedGraph → Graph

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

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

  11. type V = NativeUndirectedGraphVertex[VP]

    Definition Classes
    NativeUndirectedGraph → 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. val _edges : Set[NativeUndirectedGraphEdge[EP]]

  10. val _vertices : Set[NativeUndirectedGraphVertex[VP]]

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  12. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  13. def clone (): AnyRef

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

  14. def copyTo (other: UndirectedGraph[VP, EP]): Unit

  15. def degree (v: V): Int

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  16. def delete (v: V): Unit

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  17. def dijkstra (source: V, target: V): Map[V, Int]

    dijkstra

    dijkstra

    Modelled after psuedocode on Wikipedia:

    http://en.wikipedia.org/wiki/Dijkstra's_algorithm

  18. def edge (v1: V, v2: V, payload: EP): NativeUndirectedGraphEdge[EP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph → Graph

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  20. def edges (): Set[NativeUndirectedGraphEdge[EP]]

    Definition Classes
    NativeUndirectedGraph → Graph

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  23. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  24. def equals (arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  25. def finalize (): Unit

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

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

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

    Definition Classes
    UndirectedGraph

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

    Attributes
    final
    Definition Classes
    AnyRef → Any

  29. def hashCode (): Int

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  31. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  32. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  34. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  35. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

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

    Definition Classes
    UndirectedGraph

  37. def size (): Int

    Definition Classes
    NativeUndirectedGraph → Graph

  38. def storage (): (Set[NativeUndirectedGraphVertex[VP]], Set[NativeUndirectedGraphEdge[EP]], Map[NativeUndirectedGraphVertex[VP], Set[NativeUndirectedGraphEdge[EP]]])

    Definition Classes
    NativeUndirectedGraph → Graph

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

    Attributes
    final
    Definition Classes
    AnyRef

  40. def toString (): String

    Definition Classes
    AnyRef → Any

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

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  42. def unlink (e: E): Unit

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph

  43. def vertex (payload: VP): NativeUndirectedGraphVertex[VP]

    Definition Classes
    NativeUndirectedGraph → UndirectedGraph → Graph

  44. val vertex2edges : Map[NativeUndirectedGraphVertex[VP], Set[NativeUndirectedGraphEdge[EP]]]

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

    Definition Classes
    UndirectedGraph

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

    Definition Classes
    UndirectedGraph

  47. def vertices (): Set[NativeUndirectedGraphVertex[VP]]

    Definition Classes
    NativeUndirectedGraph → Graph

  48. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

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