Disentangle-Graph
API
Generated with
Disentangle-Graph/net.walend.disentangle.graph.semiring/OnePathFirstStep

OnePathFirstStep

net.walend.disentangle.graph.semiring.OnePathFirstStep
class OnePathFirstStep[Node, CoreLabel, Key](coreSupport: SemiringSupport[CoreLabel, Key]) extends SemiringSupport[Option[FirstStepTrait[Node, CoreLabel]], Key]

Finds one minimal path that use the core semiring.

Attributes

Since:

v0.1.0

Graph
Supertypes
trait SemiringSupport[Option[FirstStepTrait[Node, CoreLabel]], Key]
class Object
trait Matchable
class Any

Members list

Concise view

Type members

Classlikes

case class FirstStep(weight: CoreLabel, step: Option[Node]) extends FirstStepTrait[Node, CoreLabel]

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
trait FirstStepTrait[Node, CoreLabel]
class Object
trait Matchable
class Any
object OnePathSemiring extends Semiring

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
object AllPathsSemiring.type
object BrandesSemiring.type
object OnePathSemiring.type

Types

override type Label = Option[FirstStepTrait[Node, CoreLabel]]

Value members

Concrete methods

def convertEdgeToLabel[EdgeLabel](coreLabelForEdge: (Node, Node, EdgeLabel) => CoreLabel)(start: Node, end: Node, coreLabel: EdgeLabel): Label
def convertEdgeToLabelFunc[EdgeLabel](coreLabelForEdge: (Node, Node, EdgeLabel) => CoreLabel): (Node, Node, EdgeLabel) => Label
def leastPath(from: Node, to: Node, edges: Seq[(Node, Node, Label)]): Option[Seq[Node]]
def leastPath(from: Node, to: Node)(leastPathDigraph: LabelDigraph[Node, Label]): Option[Seq[InnerNodeType]]
Generated with