pharg

DirectedGraph

case class DirectedGraph[V](vertices: Set[V], edges: Set[Edge[V]]) extends DirectedGraphLike[V] with Product with Serializable

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

Instance Constructors

  1. new DirectedGraph(vertices: Set[V], edges: Set[Edge[V]])

Type Members

  1. type E = Edge[V]

    Definition Classes
    DirectedGraphLike

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. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. def clone(): AnyRef

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

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

  10. def degree(v: V): Int

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

  12. val edges: Set[Edge[V]]

    Definition Classes
    DirectedGraph → DirectedGraphLike

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

    Definition Classes
    AnyRef

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

    Definition Classes
    DirectedGraphLike

  15. def finalize(): Unit

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

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

    Definition Classes
    AnyRef → Any

  17. def hasCycle: Boolean

    Definition Classes
    DirectedGraphLike

  18. def inDegree(v: V): Int

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

  24. def isComplete: Boolean

    Definition Classes
    DirectedGraphLike

  25. def isConnected: Boolean

    Definition Classes
    DirectedGraphLike

  26. def isEmpty: Boolean

    Definition Classes
    DirectedGraphLike

  27. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

    Definition Classes
    DirectedGraphLike

  29. def isPlanar: Boolean

    Definition Classes
    DirectedGraphLike

  30. def isolatedVertices: Set[V]

    Definition Classes
    DirectedGraphLike

  31. def m: Int

    Definition Classes
    DirectedGraphLike

  32. def n: Int

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    AnyRef

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

  36. final def notify(): Unit

    Definition Classes
    AnyRef

  37. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  38. def numElements: Int

    Definition Classes
    DirectedGraphLike

  39. def outDegree(v: V): Int

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    DirectedGraphLike

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

    Definition Classes
    AnyRef

  47. def topologicalSort: List[V]

    Definition Classes
    DirectedGraphLike

  48. val vertices: Set[V]

    Definition Classes
    DirectedGraph → DirectedGraphLike

  49. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  51. 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 DirectedGraphLike[V]

Inherited from AnyRef

Inherited from Any

Ungrouped