DigraphFactory

net.walend.disentangle.graph.DigraphFactory$

Create various types of graphs.

Attributes

Since:

v0.1.0

Graph
Supertypes
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Value members

Concrete methods

def createRandomNormalDigraph(nodeCount: Int, maxOutEdgesPerNode: Int): IndexedLabelDigraph[Int, Boolean]

Create a randomly connected graph, where each node has a limited number of connections to other nodes

Create a randomly connected graph, where each node has a limited number of connections to other nodes

Attributes

def shuffleAndTake[T](items: Set[T], toTake: Int, never: T): Seq[T]