net.walend.graph

semiring

package semiring

Semirings and semiring-based graph minimizing algorithms.

SemiringSupport is the primary trait. Algorithms in this package -- Floyd-Warshall, Dijkstra's, and Brandes' algorithms -- use your choice of SemiringSupport to determine just what they are minimizing. The package also includes some common SemiringSupport implementations.

Since

v0.1.0

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. semiring
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. class AllPathsFirstSteps[Node, CoreLabel, Key] extends SemiringSupport[Option[FirstStepsTrait[Node, CoreLabel]], Key]

    Finds all minimal paths that use the core semiring.

    Finds all minimal paths that use the core semiring.

    Since

    v0.1.0

  2. trait FirstStepTrait[Node, CoreLabel] extends AnyRef

  3. trait FirstStepsTrait[Node, CoreLabel] extends AnyRef

  4. class OnePathFirstStep[Node, CoreLabel, Key] extends SemiringSupport[Option[FirstStepTrait[Node, CoreLabel]], Key]

    Finds one minimal path that use the core semiring.

    Finds one minimal path that use the core semiring.

    Since

    v0.1.0

  5. trait SemiringSupport[L, Key] extends AnyRef

    Parts for semiring-based graph minimizing algorithms.

    Parts for semiring-based graph minimizing algorithms.

    Since

    v0.1.0

  6. sealed case class TransitiveClosureHeapKey(label: Boolean, state: Int) extends Product with Serializable

Value Members

  1. object Brandes

    Brandes' algorithm for betweenness and minimal paths.

    Brandes' algorithm for betweenness and minimal paths.

    Since

    v0.1.0

  2. object Dijkstra

    An implementation of Dijkstra's algorithm for general graph minimization for both single-source and single-sink.

    An implementation of Dijkstra's algorithm for general graph minimization for both single-source and single-sink.

    Since

    v0.1.0

  3. object FewestNodes extends SemiringSupport[Int, Int]

    Finds the length of a path that traverses the fewest edges.

    Finds the length of a path that traverses the fewest edges.

    Since

    v0.1.0

  4. object FloydWarshall

    An implementation of the Floyd Warshall algorithm for general graph minimization.

    An implementation of the Floyd Warshall algorithm for general graph minimization.

    Since

    v0.1.0

  5. object LeastWeights extends SemiringSupport[Double, Double]

    Finds paths that traverse from start to end nodes with the least Double-valued weight.

    Finds paths that traverse from start to end nodes with the least Double-valued weight.

    Since

    v0.1.0

  6. object MostProbable extends SemiringSupport[Double, Double]

    Finds most probable paths that traverse from start to end nodes with the on double-weight edge (weights between zero and one).

    Finds most probable paths that traverse from start to end nodes with the on double-weight edge (weights between zero and one).

    Since

    v0.1.0

  7. object Prim

    An implementation of Prim's algorithm for minimum spanning trees

    An implementation of Prim's algorithm for minimum spanning trees

    Since

    v0.0.0

  8. object TransitiveClosure extends SemiringSupport[Boolean, TransitiveClosureHeapKey]

    Labels are true if the sink can be reached from the source, false if not.

    Labels are true if the sink can be reached from the source, false if not.

    Since

    v0.1.0

  9. object TransitiveClosureHeapKey extends Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped