LeastWeights

net.walend.disentangle.graph.semiring.LeastWeights$
object LeastWeights extends SemiringSupport[Double, Double]

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

Attributes

Since:

v0.1.0

Graph
Supertypes
trait SemiringSupport[Double, Double]
class Object
trait Matchable
class Any
Self type

Members list

Concise view

Type members

Classlikes

object LeastWeightsOrdering extends HeapOrdering[Double]

A heap ordering that puts lower numbers on the top of the heap

A heap ordering that puts lower numbers on the top of the heap

Attributes

Graph
Supertypes
trait HeapOrdering[Double]
trait PartialOrdering[Double]
trait Equiv[Double]
trait Serializable
class Object
trait Matchable
class Any
Self type

Attributes

Graph
Supertypes
trait Semiring
class Object
trait Matchable
class Any
Self type

Inherited classlikes

trait Semiring

Attributes

Inherited from:
SemiringSupport
Graph
Supertypes
class Object
trait Matchable
class Any
Known subtypes

Inherited types

type Label = L

Attributes

Inherited from:
SemiringSupport

Value members

Concrete methods

def convertEdgeToLabel[Node, Label](start: Node, end: Node, edge: Label): Label
def heapKeyForLabel: Label => Double