Class

axle.syntax

DirectedGraphOps

Related Doc: package syntax

Permalink

final class DirectedGraphOps[DG, V, E] extends AnyRef

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. DirectedGraphOps
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new DirectedGraphOps(dg: DG)(implicit ev: DirectedGraph[DG, V, E])

    Permalink

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. def areNeighbors(v1: V, v2: V)(implicit eqV: Eq[V]): Boolean

    Permalink
  5. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  6. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  7. def connects(e: E, v1: V, v2: V)(implicit eqV: Eq[V]): Boolean

    Permalink
  8. def descendants(v: V): Set[V]

    Permalink
  9. def descendantsIntersectsSet(v: V, s: Set[V]): Boolean

    Permalink
  10. def destination(e: E): V

    Permalink
  11. val dg: DG

    Permalink
  12. def edges: Iterable[E]

    Permalink
  13. def edgesTouching(v: V): Set[E]

    Permalink
  14. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  16. def filterEdges(f: (E) ⇒ Boolean): DG

    Permalink
  17. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. def findVertex(f: (V) ⇒ Boolean): Option[V]

    Permalink
  19. def forceClique(vs: Set[V], edgeFn: (V, V) ⇒ E)(implicit eqV: Eq[V], manV: Manifest[V]): DG

    Permalink
  20. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  21. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  22. def isClique(vs: Iterable[V])(implicit eqV: Eq[V]): Boolean

    Permalink
  23. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  24. def leaves: Set[V]

    Permalink
  25. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  26. def neighbors(v: V): Set[V]

    Permalink
  27. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  28. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  29. def other(e: E, v: V)(implicit eqV: Eq[V]): V

    Permalink
  30. def outputEdgesOf(v: V): Set[E]

    Permalink
  31. def precedes(v1: V, v2: V): Boolean

    Permalink
  32. def predecessors(v: V): Set[V]

    Permalink
  33. def removeInputs(vs: Set[V]): DG

    Permalink
  34. def removeOutputs(vs: Set[V]): DG

    Permalink
  35. def shortestPath(source: V, goal: V)(implicit eqV: Eq[V]): Option[List[E]]

    Permalink
  36. def source(e: E): V

    Permalink
  37. def successors(v: V): Set[V]

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

    Permalink
    Definition Classes
    AnyRef
  39. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  40. def vertices: Iterable[V]

    Permalink
  41. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  42. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  43. final def wait(arg0: Long): Unit

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

Inherited from AnyRef

Inherited from Any

Ungrouped