Trait

pharg

DirectedGraphLike

Related Doc: package pharg

Permalink

trait DirectedGraphLike[V] extends AnyRef

Linear Supertypes
AnyRef, Any
Known Subclasses
DirectedGraph, DirectedGraphData
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DirectedGraphLike
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type E = Edge[V]

    Permalink

Abstract Value Members

  1. abstract def edges: Set[E]

    Permalink

  2. abstract def vertices: Set[V]

    Permalink

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

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

  6. def connectedComponents(continue: (V) ⇒ Iterable[V]): Seq[Seq[V]]

    Permalink

  7. def connectedComponents: Seq[Seq[V]]

    Permalink

  8. def degree(v: V): Int

    Permalink

  9. def depthFirstSearch(start: V, continue: (V) ⇒ Iterable[V] = successors): Iterator[V] { ... /* 3 definitions in type refinement */ }

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  11. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  12. def filter(vp: (V) ⇒ Boolean): DirectedGraph[V]

    Permalink

  13. def finalize(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef → Any

  15. def hasCycle: Boolean

    Permalink

  16. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  17. def inDegree(v: V): Int

    Permalink

  18. def incidentEdges(vp: (V) ⇒ Boolean): Set[E]

    Permalink

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

    Permalink

  20. lazy val incomingEdges: Map[V, Set[E]]

    Permalink

  21. def inducedEdges(vp: (V) ⇒ Boolean): Set[E]

    Permalink

  22. def inducedSubGraph(vp: (V) ⇒ Boolean): DirectedGraph[V]

    Permalink

  23. def isComplete: Boolean

    Permalink

  24. def isConnected: Boolean

    Permalink

  25. def isEmpty: Boolean

    Permalink

  26. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  27. def isIsomorphicTo(that: DirectedGraphLike[V]): Boolean

    Permalink

  28. def isPlanar: Boolean

    Permalink

  29. def isolatedVertices: Set[V]

    Permalink

  30. def m: Int

    Permalink

  31. def n: Int

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  33. def neighbours(vp: (V) ⇒ Boolean): Set[V]

    Permalink

  34. lazy val neighbours: Map[V, Set[V]]

    Permalink

  35. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  36. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  37. def numElements: Int

    Permalink

  38. def outDegree(v: V): Int

    Permalink

  39. lazy val outgoingEdges: Map[V, Set[E]]

    Permalink

  40. lazy val predecessors: Map[V, Set[V]]

    Permalink

  41. def reachable(a: V, b: V): Boolean

    Permalink

  42. def stronglyConnectedComponents: Seq[Seq[V]]

    Permalink

  43. def subGraphOf(superGraph: DirectedGraphLike[V]): Boolean

    Permalink

  44. lazy val successors: Map[V, Set[V]]

    Permalink

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

    Permalink
    Definition Classes
    AnyRef

  46. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  47. def topologicalSort: List[V]

    Permalink

  48. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped