FewestNodes

net.walend.disentangle.graph.semiring.FewestNodes$
object FewestNodes extends SemiringSupport[Int, Int]

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

Attributes

Since:

v0.1.0

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

Members list

Concise view

Type members

Classlikes

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[Int]
trait PartialOrdering[Int]
trait Equiv[Int]
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(start: Any, end: Any, label: Any): Label

Concrete fields

val edgeToLabelConverter: (Any, Any, Any) => Int