Graph Core
2.0.3
API
Generated with
Graph Core/scalax.collection/scalax.collection.immutable

scalax.collection.immutable

package scalax.collection.immutable

Members list

Type members

Classlikes

trait AdjacencyListBase[N, E <: Edge[N], +CC <: ([X, Y <: Edge[X]] =>> GraphLike[X, Y, CC] & AnyGraph[X, Y])] extends GraphLike[N, E, CC]

Implementation of an incident list based graph representation. This trait is common to both the immutable and mutable variants. An incidence list based representation speeds up traversing the graph along its paths by storing the list of connecting edges at each node.

Implementation of an incident list based graph representation. This trait is common to both the immutable and mutable variants. An incidence list based representation speeds up traversing the graph along its paths by storing the list of connecting edges at each node.

Attributes

Supertypes
trait GraphLike[N, E, CC]
trait GraphDegree[N, E, CC]
trait GraphTraversal[N, E]
trait GraphBase[N, E, CC]
trait Serializable
trait GraphOps[N, E, CC]
trait OuterElems[N, E]
class Object
trait Matchable
class Any
Show all
Known subtypes
trait AdjacencyListGraph[N, E, CC]
class DefaultGraphImpl[N, E]
trait AdjacencyListGraph[N, E, CC]
class DefaultGraphImpl[N, E]
Self type
CC[N, E]
trait AdjacencyListGraph[N, E <: Edge[N], +CC <: ([X, Y <: Edge[X]] =>> AdjacencyListGraph[X, Y, CC] & Graph[X, Y])] extends GraphLike[N, E, CC], GraphOps[N, E, CC], AdjacencyListBase[N, E, CC]

Implements an incident list based immutable graph representation.

Implements an incident list based immutable graph representation.

Attributes

Supertypes
trait AdjacencyListBase[N, E, CC]
trait GraphOps[N, E, CC]
trait GraphLike[N, E, CC]
trait GraphDegree[N, E, CC]
trait GraphTraversal[N, E]
trait GraphBase[N, E, CC]
trait Serializable
trait GraphOps[N, E, CC]
trait OuterElems[N, E]
class Object
trait Matchable
class Any
Show all
Known subtypes
class DefaultGraphImpl[N, E]
Self type
CC[N, E]
class DefaultGraphImpl[N, E <: Edge[N]](iniNodes: Iterable[N], iniEdges: Iterable[E])(implicit val config: GraphConfig & AdjacencyListArrayConfig) extends Graph[N, E], AdjacencyListGraph[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]], GraphTraversalImpl[N, E]

Attributes

Companion
object
Supertypes
trait GraphTraversalImpl[N, E]
trait TraverserImpl[N, E]
trait AdjacencyListGraph[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait AdjacencyListBase[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait Graph[N, E]
trait GraphOps[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait AnyGraph[N, E]
trait GraphLike[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait GraphDegree[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait GraphTraversal[N, E]
trait GraphBase[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait Serializable
trait GraphOps[N, E, [N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait OuterElems[N, E]
class Object
trait Matchable
class Any
Show all
object DefaultGraphImpl extends ImmutableFactory[[N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]

Attributes

Companion
class
Supertypes
trait ImmutableFactory[[N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait GenericGraphCoreFactory[[N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait GenericGraphFactory[[N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
trait Factory[[N, E <: Edge[N]] =>> DefaultGraphImpl[N, E]]
class Object
trait Matchable
class Any
Show all
Self type
final class EqSet[K <: AnyRef](map: EqHashMap[K, _]) extends Set[K]

Wrapper class mimicking a scala.collection.immutable.Set without copying the contents of the underlying EqHashMap.

Wrapper class mimicking a scala.collection.immutable.Set without copying the contents of the underlying EqHashMap.

Attributes

Supertypes
trait Set[K]
trait SetOps[K, Set, Set[K]]
trait Set[K]
trait Equals
trait SetOps[K, Set, Set[K]]
trait K => Boolean
trait Iterable[K]
trait Iterable[K]
trait IterableOps[K, Set, Set[K]]
trait IterableOnceOps[K, Set, Set[K]]
trait IterableOnce[K]
class Object
trait Matchable
class Any
Show all
trait Graph[N, E <: Edge[N]] extends AnyGraph[N, E], GraphLike[N, E, [N, E <: Edge[N]] =>> Graph[N, E]], GraphOps[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]

Attributes

Companion
object
Supertypes
trait GraphOps[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait AnyGraph[N, E]
trait GraphLike[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait GraphDegree[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait GraphTraversal[N, E]
trait GraphBase[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait Serializable
trait GraphOps[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait OuterElems[N, E]
class Object
trait Matchable
class Any
Show all
Known subtypes
class DefaultGraphImpl[N, E]
object Graph extends ImmutableFactory[[N, E <: Edge[N]] =>> Graph[N, E]]

Attributes

Companion
trait
Supertypes
trait ImmutableFactory[[N, E <: Edge[N]] =>> Graph[N, E]]
trait GenericGraphCoreFactory[[N, E <: Edge[N]] =>> Graph[N, E]]
trait GenericGraphFactory[[N, E <: Edge[N]] =>> Graph[N, E]]
trait Factory[[N, E <: Edge[N]] =>> Graph[N, E]]
class Object
trait Matchable
class Any
Show all
Self type
Graph.type
trait GraphOps[N, E <: Edge[N], +CC <: ([X, Y <: Edge[X]] =>> GraphLike[X, Y, CC] & Graph[X, Y])]

Immutable graph only operations.

Immutable graph only operations.

$define edgesOnlyUseCase Provided for the use case when you don't need to pass any isolated node.

Attributes

Supertypes
class Object
trait Matchable
class Any
Known subtypes
trait AdjacencyListGraph[N, E, CC]
class DefaultGraphImpl[N, E]
trait Graph[N, E]
class SortedArraySet[A](array: Array[A])(implicit val ordering: Ordering[A]) extends AbstractSet[A], SortedSet[A], SortedSetOps[A, SortedArraySet, SortedArraySet[A]], StrictOptimizedSortedSetOps[A, SortedArraySet, SortedArraySet[A]], SortedSetFactoryDefaults[A, SortedArraySet, Set], DefaultSerializable

Attributes

Companion
object
Supertypes
trait Serializable
trait SortedSet[A]
trait SortedSet[A]
trait SortedOps[A, SortedArraySet[A]]
class AbstractSet[A]
trait Set[A]
trait SetOps[A, Set, SortedArraySet[A]]
trait Iterable[A]
class AbstractSet[A]
trait Set[A]
trait Equals
trait SetOps[A, Set, SortedArraySet[A]]
trait (A) => Boolean
class AbstractIterable[A]
trait Iterable[A]
trait IterableOnce[A]
class Object
trait Matchable
class Any
Show all
Self type
object SortedArraySet extends SortedIterableFactory[SortedArraySet]

Attributes

Companion
class
Supertypes
trait Serializable
class Object
trait Matchable
class Any
Show all
Self type
trait TypedGraphFactory[N, E <: Edge[N]] extends TypedGraphCoreFactory[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]

Attributes

Supertypes
trait TypedGraphCoreFactory[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait TypedGraphFactory[N, E, [N, E <: Edge[N]] =>> Graph[N, E]]
trait Factory[[N, E <: Edge[N]] =>> Graph[N, E]]
class Object
trait Matchable
class Any
Show all
Generated with