AllPathsFirstSteps

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

Finds all minimal paths that use the core semiring.

Attributes

Since:

v0.1.0

Graph
Supertypes
trait Serializable
trait Product
trait Equals
trait SemiringSupport[Option[FirstStepsTrait[Node, CoreLabel]], Key]
class Object
trait Matchable
class Any

Members list

Concise view

Type members

Classlikes

object AllPathsSemiring extends Semiring

Attributes

Graph
Supertypes
trait Semiring
class Object
trait Matchable
class Any
Self type
case class FirstSteps(pathWeight: CoreLabel, choices: Set[Node]) extends FirstStepsTrait[Node, CoreLabel]

Attributes

Graph
Supertypes
trait Serializable
trait Product
trait Equals
trait FirstStepsTrait[Node, CoreLabel]
class Object
trait Matchable
class Any

Inherited classlikes

trait Semiring

Attributes

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

Types

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

Value members

Concrete methods

def allLeastPaths(leastPathDigraph: LabelDigraph[Node, Label], from: Node, to: Node): Seq[Seq[InnerNodeType]]
def convertEdgeToLabel[EdgeLabel](coreLabelForEdge: (Node, Node, EdgeLabel) => CoreLabel)(start: Node, end: Node, edgeLabel: EdgeLabel): Label
def convertEdgeToLabelFunc[EdgeLabel](coreLabelForEdge: (Node, Node, EdgeLabel) => CoreLabel): (Node, Node, EdgeLabel) => Label
def subgraphEdges(labelGraph: IndexedLabelDigraph[Node, Label], from: Node, to: Node): Set[InnerEdgeType]

Create the acyclic subgraph defined by BrandesSupport

Create the acyclic subgraph defined by BrandesSupport

Attributes

Inherited methods

def productElementNames: Iterator[String]

Attributes

Inherited from:
Product
def productIterator: Iterator[Any]

Attributes

Inherited from:
Product