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

Graph

problemutils.classes.graphs.Graph
See theGraph companion object
trait Graph[V]

Attributes

Companion
object
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait DynamicGraph[V]
class LazyGraph[V]
class ProceduralGraph[V]
class FiniteGraph[V]

Members list

Value members

Abstract methods

def diff(g: Graph[V]): Graph[V]
def edges: Set[Edge[V]]
def edgesFrom: Map[V, Set[Edge[V]]]
def edgesTo: Map[V, Set[Edge[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(g: Graph[V]): Graph[V]
def union(g: Graph[V]): Graph[V]
def vertices: Set[V]

Concrete methods

def &(g: Graph[V]): Graph[V]
def +(e: Edge[V]): Graph[V]
def -(e: Edge[V]): Graph[V]
def \(g: Graph[V]): Graph[V]
def allPathsFrom(start: V): Set[Path[V]]
def apply(v: V): Set[V]
def apply(a: V, b: V): Option[Double]
def reachableFrom(start: V): Set[V]
def shortestPath(start: V, end: V, heuristic: V => Double): Option[Path[V]]
def shortestPathUntil(start: V, endPred: V => Boolean, heuristic: V => Double): Option[Path[V]]
def |(g: Graph[V]): Graph[V]
Generated with