pharg

DirectedGraphLike

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
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type E = Edge[V]

Abstract Value Members

  1. abstract def edges: Set[E]

  2. abstract def vertices: Set[V]

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

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

  10. def degree(v: V): Int

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

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

    Definition Classes
    AnyRef

  13. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

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

  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

  18. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  19. def inDegree(v: V): Int

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

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

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

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

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

  25. def isComplete: Boolean

  26. def isConnected: Boolean

  27. def isEmpty: Boolean

  28. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

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

  30. def isPlanar: Boolean

  31. def isolatedVertices: Set[V]

  32. def m: Int

  33. def n: Int

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

    Definition Classes
    AnyRef

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

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

  37. final def notify(): Unit

    Definition Classes
    AnyRef

  38. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  39. def numElements: Int

  40. def outDegree(v: V): Int

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

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

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

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

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

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

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

    Definition Classes
    AnyRef

  48. def toString(): String

    Definition Classes
    AnyRef → Any

  49. def topologicalSort: List[V]

  50. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped