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

DynamicGraph

problemutils.classes.graphs.DynamicGraph
trait DynamicGraph[V](using val adjacencyFunction: V => Set[Edge[V]]) extends Graph[V]

Attributes

Graph
Supertypes
trait Graph[V]
class Object
trait Matchable
class Any
Known subtypes
class LazyGraph[V]
class ProceduralGraph[V]

Members list

Value members

Concrete methods

def diff(other: Graph[V]): Graph[V]
def excl(e: Edge[V]): Graph[V]
def filterEdges(p: Edge[V] => Boolean): Graph[V]
def filterVertices(p: V => Boolean): Graph[V]
def incl(e: Edge[V]): Graph[V]
def intersect(other: Graph[V]): Graph[V]
def union(other: Graph[V]): Graph[V]

Inherited methods

def &(g: Graph[V]): Graph[V]

Attributes

Inherited from:
Graph
def +(e: Edge[V]): Graph[V]

Attributes

Inherited from:
Graph
def -(e: Edge[V]): Graph[V]

Attributes

Inherited from:
Graph
def \(g: Graph[V]): Graph[V]

Attributes

Inherited from:
Graph
def allPathsFrom(start: V): Set[Path[V]]

Attributes

Inherited from:
Graph
def apply(a: V, b: V): Option[Double]

Attributes

Inherited from:
Graph
def apply(v: V): Set[V]

Attributes

Inherited from:
Graph
def edges: Set[Edge[V]]

Attributes

Inherited from:
Graph
def edgesFrom: Map[V, Set[Edge[V]]]

Attributes

Inherited from:
Graph
def edgesTo: Map[V, Set[Edge[V]]]

Attributes

Inherited from:
Graph
def reachableFrom(start: V): Set[V]

Attributes

Inherited from:
Graph
def shortestPath(start: V, end: V, heuristic: V => Double): Option[Path[V]]

Attributes

Inherited from:
Graph
def shortestPathUntil(start: V, endPred: V => Boolean, heuristic: V => Double): Option[Path[V]]

Attributes

Inherited from:
Graph
def vertices: Set[V]

Attributes

Inherited from:
Graph
def |(g: Graph[V]): Graph[V]

Attributes

Inherited from:
Graph

Givens

Givens

given adjacencyFunction: V => Set[Edge[V]]
Generated with