AdjacencyDigraph

net.walend.disentangle.graph.AdjacencyDigraph$
See theAdjacencyDigraph companion class

O(n ln(n) + e ln(n))

Attributes

Companion:
class
Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Value members

Concrete methods

def apply[Node](edges: Iterable[(Node, Node)], nodes: Seq[Node]): AdjacencyDigraph[Node]