AdjacencyLabelDigraph

net.walend.disentangle.graph.AdjacencyLabelDigraph$
See theAdjacencyLabelDigraph 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, Label](edges: Iterable[(Node, Node, Label)], nodes: Seq[Node], noEdgeExistsValue: Label): AdjacencyLabelDigraph[Node, Label]