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

LabelUndigraphSemiringAlgorithms

net.walend.disentangle.graph.semiring.package$.LabelUndigraphSemiringAlgorithms
implicit class LabelUndigraphSemiringAlgorithms[Node, Label](self: LabelUndigraph[Node, Label])

Attributes

Since:

v0.2.1 Helper methods for LabelUndigraphs

Graph
Supertypes
class Object
trait Matchable
class Any

Members list

Concise view

Value members

Concrete methods

def allLeastPathsAndBetweenness[CoreLabel, Key](coreSupport: SemiringSupport[CoreLabel, Key], labelForEdge: (Node, Node, Label) => CoreLabel): (IndexedSeq[(Node, Node, Option[BrandesSteps[Node, CoreLabel]])], Map[Node, Double])
def allPairsLeastPaths[SemiringLabel, Key](support: SemiringSupport[SemiringLabel, Key], labelForEdge: (Node, Node, Label) => SemiringLabel): Seq[(Node, Node, SemiringLabel)]
def allPairsShortestPaths: Seq[(Node, Node, Option[FirstStepsTrait[Node, Int]])]
def correctForUndigraph[CoreLabel](digraphResult: (IndexedSeq[(Node, Node, Option[BrandesSteps[Node, CoreLabel]])], Map[Node, Double])): (IndexedSeq[(Node, Node, Option[BrandesSteps[Node, CoreLabel]])], Map[Node, Double])
def diEdges: Iterable[(Node, Node, Label)]
Generated with