ProblemUtils/problemutils.classes.graphs/Graph

Graph

object Graph
Companion:
class
class Object
trait Matchable
class Any
Graph.type

Value members

Concrete methods

def apply[V](elems: (V, V)*): FiniteGraph[V]
def empty[V]: FiniteGraph[V]
def from[V](edges: IterableOnce[Edge[V]]): FiniteGraph[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.

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.

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