ProblemUtils/problemutils.classes.graphs/FiniteGraph

FiniteGraph

case class FiniteGraph[V] extends Graph[V]
Companion:
object
trait Serializable
trait Product
trait Equals
trait Graph[V]
class Object
trait Matchable
class Any

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]
override def toString: String

Returns a string representation of the object.

Returns a string representation of the object.

The default representation is platform dependent.

Returns:

a string representation of the object.

Definition Classes
Any
def totalCost: Double
def transpose: FiniteGraph[V]

Reverses all the edges in the graph.

Reverses all the edges in the graph.

def union(other: Graph[V]): Graph[V]

Inherited methods

def &(g: Graph[V]): Graph[V]
Inherited from:
Graph
def +(e: Edge[V]): Graph[V]
Inherited from:
Graph
def -(e: Edge[V]): Graph[V]
Inherited from:
Graph
def \(g: Graph[V]): Graph[V]
Inherited from:
Graph
def apply(a: V, b: V): Option[Double]
Inherited from:
Graph
def apply(v: V): Set[V]
Inherited from:
Graph
def pathBetween(start: V, end: V, heuristic: V => Double): Option[Path[V]]
Inherited from:
Graph
def pathsFrom(start: V): Set[Path[V]]
Inherited from:
Graph
def productElementNames: Iterator[String]
Inherited from:
Product
def productIterator: Iterator[Any]
Inherited from:
Product
def reachableFrom(start: V): Set[V]
Inherited from:
Graph
def |(g: Graph[V]): Graph[V]
Inherited from:
Graph

Concrete fields

val edges: Set[Edge[V]]
lazy val edgesFrom: Map[V, Set[Edge[V]]]
lazy val edgesTo: Map[V, Set[Edge[V]]]
lazy val vertices: Set[V]