axle.graph

DirectedGraph

trait DirectedGraph[VP, EP] extends AnyRef

Linear Supertypes
AnyRef, Any
Known Subclasses
JungDirectedGraph, NativeDirectedGraph
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. DirectedGraph
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. abstract type ES

  2. abstract type G[VP, EP] <: DirectedGraph[VP, EP]

Abstract Value Members

  1. abstract def allEdges(): Set[Edge[ES, EP]]

  2. abstract def deleteVertex(v: Vertex[VP]): G[VP, EP]

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

  4. abstract def dest(edge: Edge[ES, EP]): Vertex[VP]

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

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

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

  8. abstract def isAcyclic(): Boolean

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

  10. abstract def leaves(): Set[Vertex[VP]]

  11. abstract def map[NVP, NEP](vpf: (VP) ⇒ NVP, epf: (EP) ⇒ NEP)(implicit arg0: Manifest[NVP]): G[NVP, NEP]

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

  13. abstract def outputEdgesOf(v: Vertex[VP]): Set[Edge[ES, EP]]

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

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

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

  17. abstract def size(): Int

  18. abstract def source(edge: Edge[ES, EP]): Vertex[VP]

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

  20. abstract def vertexPayloads(): Seq[VP]

  21. abstract def vertices(): Set[Vertex[VP]]

Concrete 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]]

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

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

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

  10. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  11. def clone(): AnyRef

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

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

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

    Definition Classes
    AnyRef

  14. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  15. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  17. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    AnyRef

  20. final def notify(): Unit

    Definition Classes
    AnyRef

  21. final def notifyAll(): Unit

    Definition Classes
    AnyRef

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

    Definition Classes
    AnyRef

  23. def toString(): String

    Definition Classes
    AnyRef → Any

  24. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

  26. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

Inherited from AnyRef

Inherited from Any

Ungrouped