axle.graph

JungDirectedGraph

case class JungDirectedGraph[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. JungDirectedGraph
  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 JungDirectedGraph(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
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → 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. def allEdges(): Set[Edge[(Vertex[VP], Vertex[VP], EP), EP]]

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    DirectedGraph

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

    Definition Classes
    DirectedGraph

  11. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  12. def clone(): AnyRef

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

  13. def deleteEdge(e: Edge[(Vertex[VP], Vertex[VP], EP), EP]): JungDirectedGraph[VP, EP]

  14. def deleteVertex(v: Vertex[VP]): JungDirectedGraph[VP, EP]

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

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

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

    Definition Classes
    AnyRef

  22. def filterEdges(f: ((Vertex[VP], Vertex[VP], EP)) ⇒ Boolean): JungDirectedGraph[VP, EP]

  23. def finalize(): Unit

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

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    AnyRef → Any

  27. def isAcyclic(): Nothing

    Definition Classes
    JungDirectedGraph → DirectedGraph

  28. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  30. lazy val jungGraph: DirectedSparseGraph[Vertex[VP], Edge[(Vertex[VP], Vertex[VP], EP), EP]]

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  33. def moralGraph(): Nothing

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

    Definition Classes
    AnyRef

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  36. final def notify(): Unit

    Definition Classes
    AnyRef

  37. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  41. def removeInputs(to: Set[Vertex[VP]]): JungDirectedGraph[VP, EP]

  42. def removeOutputs(from: Set[Vertex[VP]]): JungDirectedGraph[VP, EP]

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  44. def size(): Int

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  46. def storage(): DirectedSparseGraph[Vertex[VP], Edge[(Vertex[VP], Vertex[VP], EP), EP]]

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

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

    Definition Classes
    AnyRef

  49. def vertexPayloads(): Seq[VP]

    Definition Classes
    JungDirectedGraph → DirectedGraph

  50. lazy val vertexSeq: Seq[Vertex[VP]]

  51. lazy val vertexSet: Set[Vertex[VP]]

  52. def vertexToVisualizationHtml(vp: VP): Node

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

    Definition Classes
    JungDirectedGraph → DirectedGraph

  54. def verticesSeq(): Seq[Vertex[VP]]

  55. val vps: Seq[VP]

  56. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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