Packages

t

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
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: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def connectedComponents(continue: (V) ⇒ Iterable[V]): Set[Set[V]]
  7. def connectedComponents: Set[Set[V]]
  8. def degree(v: V): Int
  9. def depthFirstSearch(start: V, continue: (V) ⇒ Iterable[V] = successors): Iterator[V] { ... /* 3 definitions in type refinement */ }
  10. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  11. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  12. def filter(vp: (V) ⇒ Boolean): DirectedGraph[V]
  13. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  15. def hasCycle: Boolean
  16. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  17. def inDegree(v: V): Int
  18. def incidentEdges(vp: (V) ⇒ Boolean): Set[E]
  19. def incidentEdges(v: V): Set[E]
  20. lazy val incomingEdges: Map[V, Set[E]]
  21. def inducedEdges(vp: (V) ⇒ Boolean): Set[E]
  22. def inducedSubGraph(vp: (V) ⇒ Boolean): DirectedGraph[V]
  23. def isComplete: Boolean
  24. def isConnected: Boolean
  25. def isEmpty: Boolean
  26. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  27. def isIsomorphicTo(that: DirectedGraphLike[V]): Boolean
  28. def isPlanar: Boolean
  29. def isolatedVertices: Set[V]
  30. def m: Int
  31. def n: Int
  32. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  33. def neighbours(vp: (V) ⇒ Boolean): Set[V]
  34. lazy val neighbours: Map[V, Set[V]]
  35. final def notify(): Unit
    Definition Classes
    AnyRef
  36. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  37. def numElements: Int
  38. def outDegree(v: V): Int
  39. lazy val outgoingEdges: Map[V, Set[E]]
  40. lazy val predecessors: Map[V, Set[V]]
  41. def reachable(a: V, b: V): Boolean
  42. def stronglyConnectedComponents: Set[Set[V]]
  43. def subGraphOf(superGraph: DirectedGraphLike[V]): Boolean
  44. lazy val successors: Map[V, Set[V]]
  45. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  46. def toString(): String
    Definition Classes
    AnyRef → Any
  47. def topologicalSort: List[V]
  48. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  49. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped