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

problemutils.classes.graphs

package problemutils.classes.graphs

Members list

Type members

Classlikes

case class DisjointSets[V](var nodes: V*)

A generic mutable implementation of the disjoint sets data structure.

A generic mutable implementation of the disjoint sets data structure.

Value parameters

nodes

all the vertices currently tracked by this data structure

Attributes

Companion
object
Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all
object DisjointSets

Attributes

Companion
class
Supertypes
trait Product
trait Mirror
class Object
trait Matchable
class Any
Self type
trait DynamicGraph[V](using val adjacencyFunction: V => Set[Edge[V]]) extends Graph[V]

Attributes

Supertypes
trait Graph[V]
class Object
trait Matchable
class Any
Known subtypes
class LazyGraph[V]
class ProceduralGraph[V]
case class Edge[V](from: V, to: V, weight: Double)

A simple generic edge class. Can represent either a directed or an undirected edge, and so has both from / to vertex parameters, as well as u and v value members for easy disambiguation.

A simple generic edge class. Can represent either a directed or an undirected edge, and so has both from / to vertex parameters, as well as u and v value members for easy disambiguation.

Value parameters

from

the source vertex

to

the destination vertex

u

alias for from

v

alias for to

weight

the cost of traveling along this edge, defaults to 1 if not provided

Attributes

Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all
case class FiniteGraph[V] extends Graph[V]

Attributes

Companion
object
Supertypes
trait Serializable
trait Product
trait Equals
trait Graph[V]
class Object
trait Matchable
class Any
Show all
object FiniteGraph

Attributes

Companion
class
Supertypes
trait Product
trait Mirror
class Object
trait Matchable
class Any
Self type
trait Graph[V]

Attributes

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

Attributes

Companion
trait
Supertypes
class Object
trait Matchable
class Any
Self type
Graph.type
class LazyGraph[V] extends DynamicGraph[V]

Attributes

Companion
object
Supertypes
trait DynamicGraph[V]
trait Graph[V]
class Object
trait Matchable
class Any
object LazyGraph

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type
LazyGraph.type
case class Path[V](vertices: Seq[V], cost: Double)

Value parameters

cost

the total cost of the path

vertices

the ordered sequence of vertices making up the path

Attributes

Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all
class ProceduralGraph[V] extends DynamicGraph[V]

Attributes

Companion
object
Supertypes
trait DynamicGraph[V]
trait Graph[V]
class Object
trait Matchable
class Any
object ProceduralGraph

Attributes

Companion
class
Supertypes
class Object
trait Matchable
class Any
Self type
case class Tree[V](value: V, children: Set[Tree[V]])

A simple recursive tree class.

A simple recursive tree class.

Value parameters

children

The children of this node.

value

The value of this node.

Attributes

Supertypes
trait Serializable
trait Product
trait Equals
class Object
trait Matchable
class Any
Show all
Generated with