axle.graph

NativeDirectedGraph

case class NativeDirectedGraph[VP, EP](vps: Seq[VP], ef: (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)]) extends DirectedGraph[VP, EP] with Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, DirectedGraph[VP, EP], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NativeDirectedGraph
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. DirectedGraph
  7. AnyRef
  8. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NativeDirectedGraph(vps: Seq[VP], ef: (Seq[Vertex[VP]]) ⇒ Seq[(Vertex[VP], Vertex[VP], EP)])

Type Members

  1. type ES = (Vertex[VP], Vertex[VP], EP)

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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 _ancestors(v: Vertex[VP], accumulator: Set[Vertex[VP]]): Set[Vertex[VP]]

    Definition Classes
    DirectedGraph

  7. def _descendants(v: Vertex[VP], accumulator: Set[Vertex[VP]]): Set[Vertex[VP]]

    Definition Classes
    DirectedGraph

  8. lazy val _edges: Seq[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

  9. lazy val _edgesSet: Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

  10. def _shortestPath(source: Vertex[VP], goal: Vertex[VP], visited: Set[Vertex[VP]]): Option[List[Edge[(Vertex[VP], Vertex[VP], EP), EP]]]

    shortestPath

    shortestPath

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

  11. lazy val _vertices: Seq[Vertex[VP]]

  12. lazy val _verticesSet: Set[Vertex[VP]]

  13. def allEdges(): Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  14. def ancestors(vs: Set[Vertex[VP]]): Set[Vertex[VP]]

    Definition Classes
    DirectedGraph

  15. def ancestors(v: Vertex[VP]): Set[Vertex[VP]]

    Definition Classes
    DirectedGraph

  16. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  17. def clone(): AnyRef

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

  18. def deleteEdge(e: Edge[(Vertex[VP], Vertex[VP], EP), EP]): NativeDirectedGraph[VP, EP]

  19. def deleteVertex(v: Vertex[VP]): NativeDirectedGraph[VP, EP]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  20. def descendants(v: Vertex[VP]): Set[Vertex[VP]]

    Definition Classes
    DirectedGraph

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

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  22. def dest(edge: Edge[(Vertex[VP], Vertex[VP], EP), EP]): Vertex[VP]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

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

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

    Definition Classes
    AnyRef

  27. def filterEdges(f: ((Vertex[VP], Vertex[VP], EP)) ⇒ Boolean): NativeDirectedGraph[VP, EP]

  28. def finalize(): Unit

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

  29. def findEdge(from: Vertex[VP], to: Vertex[VP]): Option[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

    Definition Classes
    AnyRef → Any

  32. def isAcyclic(): Boolean

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  33. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  34. def isLeaf(v: Vertex[VP]): Boolean

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  35. def leaves(): Set[Vertex[VP]]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

    Definition Classes
    AnyRef

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

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  39. final def notify(): Unit

    Definition Classes
    AnyRef

  40. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  41. def outputEdgesOf(v: Vertex[VP]): Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  42. def precedes(v1: Vertex[VP], v2: Vertex[VP]): Boolean

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  43. def predecessors(v: Vertex[VP]): Set[Vertex[VP]]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  44. def removeInputs(to: Set[Vertex[VP]]): NativeDirectedGraph[VP, EP]

  45. def removeOutputs(from: Set[Vertex[VP]]): NativeDirectedGraph[VP, EP]

  46. def shortestPath(source: Vertex[VP], goal: Vertex[VP]): Option[List[Edge[(Vertex[VP], Vertex[VP], EP), EP]]]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  47. def size(): Int

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  48. def source(edge: Edge[(Vertex[VP], Vertex[VP], EP), EP]): Vertex[VP]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  49. def storage(): (Set[Vertex[VP]], Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]], Map[Vertex[VP], Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]], Map[Vertex[VP], Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]])

  50. def successors(v: Vertex[VP]): Set[Vertex[VP]]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

    Definition Classes
    AnyRef

  52. lazy val vertex2inedges: Map[Vertex[VP], Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]]

  53. lazy val vertex2outedges: Map[Vertex[VP], Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]]

  54. def vertexPayloads(): Seq[VP]

    Definition Classes
    NativeDirectedGraph → DirectedGraph

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

    Definition Classes
    NativeDirectedGraph → DirectedGraph

  56. val vps: Seq[VP]

  57. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  59. 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 DirectedGraph[VP, EP]

Inherited from AnyRef

Inherited from Any

Ungrouped