CycleRemover

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def reflowGraph(graph: Graph[V], vertexSequence: List[V]): (Graph[V], List[(V, V)])

Given an ordering of the vertices of the graph, return a new graph with all edges that go against the flow of that ordering reversed, together with a list of edges (in the new graph) that have been reversed.

def removeCycles(graph: Graph[V]): (Graph[V], List[(V, V)])

def removeSelfLoops(graph: Graph[V]): (Graph[V], List[(V, V)])

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

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit