AdjacencyLabelUndigraph

net.walend.disentangle.graph.AdjacencyLabelUndigraph$
See theAdjacencyLabelUndigraph 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[(NodePair[Node], Label)], nodes: Seq[Node], noEdgeExists: Label): AdjacencyLabelUndigraph[Node, Label]