ProblemUtils
API
Generated with
ProblemUtils/problemutils/problemutils.classes/problemutils.classes.graphs/Graph

Graph

problemutils.classes.graphs.Graph$
See theGraph companion trait
object Graph

Attributes

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

Members list

Value members

Concrete methods

def apply[V](elems: (V, V)*): FiniteGraph[V]
def empty[V]: Graph[V]
def from[V](edges: IterableOnce[Edge[V]]): FiniteGraph[V]
def fromMap[V](map: Map[V, IterableOnce[V]]): Graph[V]
def fromMatrix[V](matrix: Matrix[V], joined: (V, V) => Boolean, cost: (V, V) => Double): Graph[V]
def fromTuples[V](edges: IterableOnce[(V, V)]): FiniteGraph[V]
def generate[V](adjacencyFunction: V => IterableOnce[V]): ProceduralGraph[V]

Creates a lazily generated graph where the edges between vertices are procedurally generated by the given adjacency function.

Creates a lazily generated graph where the edges between vertices are procedurally generated by the given adjacency function.

Attributes

def generateLazily[V](adjacencyFunction: V => IterableOnce[V]): LazyGraph[V]

Creates a lazily generated graph where the edges between vertices are procedurally generated by the given adjacency function and then cached.

Creates a lazily generated graph where the edges between vertices are procedurally generated by the given adjacency function and then cached.

Attributes

def generateLazilyWith[V](adjacencyFunction: V => IterableOnce[Edge[V]]): LazyGraph[V]
def generateWith[V](adjacencyFunction: V => IterableOnce[Edge[V]]): ProceduralGraph[V]
Generated with