axle.graph.NativeDirectedGraphFactory

NativeDirectedGraph

trait NativeDirectedGraph [VP, EP] extends DirectedGraph[VP, EP]

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

Type Members

  1. trait DirectedGraphEdge [P] extends GraphEdge[P]

  2. trait DirectedGraphVertex [P] extends GraphVertex[P]

  3. type E = NativeDirectedGraphEdge[EP]

    Definition Classes
    NativeDirectedGraph → DirectedGraph → Graph

  4. trait GraphEdge [P] extends AnyRef

  5. trait GraphVertex [P] extends AnyRef

  6. trait NativeDirectedGraphEdge [P] extends DirectedGraphEdge[P]

  7. class NativeDirectedGraphEdgeImpl [P] extends NativeDirectedGraphEdge[P]

  8. trait NativeDirectedGraphVertex [P] extends DirectedGraphVertex[P]

  9. class NativeDirectedGraphVertexImpl [P] extends NativeDirectedGraphVertex[P]

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

    Definition Classes
    NativeDirectedGraph → Graph

  11. type V = NativeDirectedGraphVertex[VP]

    Definition Classes
    NativeDirectedGraph → DirectedGraph → 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 _ancestors (v: V, result: Set[V]): Unit

    Definition Classes
    DirectedGraph

  10. def _descendants (v: V, result: Set[V]): Unit

    Definition Classes
    DirectedGraph

  11. val _edges : Set[NativeDirectedGraphEdge[EP]]

  12. def _shortestPath (source: V, goal: V, visited: Set[V]): Option[List[E]]

    shortestPath

    shortestPath

    TODO: This is just a quick, dirty, slow, and naive algorithm.

  13. val _vertices : Set[NativeDirectedGraphVertex[VP]]

  14. def ancestors (vs: Set[V]): Set[V]

    Definition Classes
    DirectedGraph

  15. def ancestors (v: V): Set[V]

    Definition Classes
    DirectedGraph

  16. def asInstanceOf [T0] : T0

    Attributes
    final
    Definition Classes
    Any

  17. def clone (): AnyRef

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

  18. def deleteEdge (e: E): Unit

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  19. def deleteVertex (v: V): Unit

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  20. def descendants (v: V): Set[V]

    Definition Classes
    DirectedGraph

  21. def descendantsIntersectsSet (v: V, s: Set[V]): Boolean

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  22. def edge (source: V, dest: V, payload: EP): E

    Definition Classes
    NativeDirectedGraph → Graph

  23. def edges (): Set[NativeDirectedGraphEdge[EP]]

    Definition Classes
    NativeDirectedGraph → Graph

  24. def eq (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

  25. def equals (arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  26. def finalize (): Unit

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

  27. def findEdge (from: V, to: V): Option[E]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

    Attributes
    final
    Definition Classes
    AnyRef → Any

  29. def hashCode (): Int

    Definition Classes
    AnyRef → Any

  30. def isAcyclic (): Boolean

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  31. def isInstanceOf [T0] : Boolean

    Attributes
    final
    Definition Classes
    Any

  32. def isLeaf (v: V): Boolean

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  33. def leaves (): Set[V]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  34. def ne (arg0: AnyRef): Boolean

    Attributes
    final
    Definition Classes
    AnyRef

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

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  36. def notify (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  37. def notifyAll (): Unit

    Attributes
    final
    Definition Classes
    AnyRef

  38. def outputEdgesOf (v: V): Set[E]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  39. def precedes (v1: V, v2: V): Boolean

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  40. def predecessors (v: V): Set[V]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  41. def removeInputs (vs: Set[V]): Unit

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  42. def removeOutputs (vs: Set[V]): Unit

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  43. def removePredecessor (v: V, predecessor: V): Unit

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  44. def removeSuccessor (v: V, successor: V): Unit

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  45. def shortestPath (source: V, goal: V): Option[List[E]]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  46. def size (): Int

    Definition Classes
    NativeDirectedGraph → Graph

  47. def storage (): (Set[NativeDirectedGraphVertex[VP]], Set[NativeDirectedGraphEdge[EP]], Map[NativeDirectedGraphVertex[VP], Set[NativeDirectedGraphEdge[EP]]], Map[NativeDirectedGraphVertex[VP], Set[NativeDirectedGraphEdge[EP]]])

    Definition Classes
    NativeDirectedGraph → Graph

  48. def successors (v: V): Set[V]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

    Attributes
    final
    Definition Classes
    AnyRef

  50. def toString (): String

    Definition Classes
    AnyRef → Any

  51. def vertex (payload: VP): V

    Definition Classes
    NativeDirectedGraph → Graph

  52. val vertex2inedges : Map[NativeDirectedGraphVertex[VP], Set[NativeDirectedGraphEdge[EP]]]

  53. val vertex2outedges : Map[NativeDirectedGraphVertex[VP], Set[NativeDirectedGraphEdge[EP]]]

  54. def vertices (): Set[NativeDirectedGraphVertex[VP]]

    Definition Classes
    NativeDirectedGraph → Graph

  55. def wait (): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

  57. def wait (arg0: Long): Unit

    Attributes
    final
    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from DirectedGraph[VP, EP]

Inherited from Graph[VP, EP]

Inherited from AnyRef

Inherited from Any