net.walend.disentangle.graph.semiring.FloydWarshall$
An implementation of the Floyd Warshall algorithm for general graph minimization.
Attributes
- Since:
v0.1.0
- Graph
- Supertypes
class Object
trait Matchable
class Any
- Self type
Members list
Concise view
Value members
Create a digraph of Labels from an arbitrary Digraph.
Create a digraph of Labels from an arbitrary Digraph.
O(n ln(n) + an)
Attributes
- Returns:
a Digraph with graph's nodes, a self-edge for each node with the semiring's identifier, and an edge for each edge specified by labelForEdge.