scalax

collection

package collection

Contains the base traits and objects needed to use Graph for Scala.

See also the Graph for Scala Core User Guide.

Linear Supertypes
AnyRef, Any
Content Hierarchy Learn more about scaladoc diagrams
TraverserImpl[N, E]GraphTraversalImpl[N, E]State[N, E]GraphTraversal[N, E]GraphLike[N, E, This]GraphDegree[N, E]GraphBase[N, E]Graph[N, E]
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. collection
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. type AnySet[A] = Set[A]

    Attributes
    protected[scalax]

  2. type ExtSet[A] = Set[A] with ExtSetMethods[A]

    scala.collection.Set extended by some useful methods in the context of Graph.

  3. trait Graph[N, E[X] <: EdgeLikeIn[X]] extends AnySet[Param[N, E]] with GraphLike[N, E, Graph]

    The main trait for immutable graphs bundling the functionality of traits concerned with specific aspects.

  4. trait GraphBase[N, E[X] <: EdgeLikeIn[X]] extends Serializable

    Base template trait for graphs.

  5. trait GraphDegree[N, E[X] <: EdgeLikeIn[X]] extends AnyRef

    A trait for graph degree calculations.

  6. trait GraphLike[N, E[X] <: EdgeLikeIn[X], +This[X, Y[X] <: EdgeLikeIn[X]] <: GraphLike[X, Y[X], This] with AnySet[Param[X, Y[X]]] with Graph[X, Y[X]]] extends SetLike[Param[N, E], This[N, E]] with GraphTraversal[N, E] with GraphBase[N, E] with GraphDegree[N, E]

    A template trait for graphs.

  7. trait GraphTraversal[N, E[X] <: EdgeLikeIn[X]] extends GraphBase[N, E]

    Graph-related functionality such as traversals, path finding, cycle detection etc.

  8. trait GraphTraversalImpl[N, E[X] <: EdgeLikeIn[X]] extends GraphTraversal[N, E] with TraverserImpl[N, E] with State[N, E]

    Default implementation of the functionality defined by GraphTraversal except for algorithms that are placed in TraverserImpl.

  9. type MSet[A] = Set[A]

    Attributes
    protected[scalax]

  10. trait State[N, E[X] <: EdgeLikeIn[X]] extends AnyRef

    Adds bit fields to the graph and its nodes facilitating fast storage and retrieval of traversal-specific flags as a decoupled implementation trait.

  11. trait TraverserImpl[N, E[X] <: EdgeLikeIn[X]] extends AnyRef

    Default implementation of the graph algorithms to maintain the functionality defined by GraphTraversal.

Value Members

  1. val AnyDegree: (Int) ⇒ Boolean

    The default filter function for degrees to be included in degree calculation always returning true.

  2. object Graph extends GraphCoreCompanion[Graph] with Serializable

    The main companion object for immutable graphs.

  3. object GraphBase extends Serializable

  4. object GraphEdge

    This object serves as a container for all edge-types to be used in the context of Graph.

  5. object GraphPredef

    This object serves as a container for several Graph-related definitions like parameter-types and implicit conversions.

  6. object GraphTraversal extends Serializable

    Contains traversal parameter definitions such as direction constants.

  7. object GraphTraversalImpl extends Serializable

  8. final def MSet: Set.type

    Attributes
    protected[scalax]
    Annotations
    @inline()

  9. object State

  10. package config

  11. package edge

    Predefined edges.

  12. package generic

  13. package immutable

  14. package interfaces

  15. package mutable

Inherited from AnyRef

Inherited from Any

Ungrouped