WeightedGraphImpl
org.encalmo.data.Graph.WeightedGraphImpl
final class WeightedGraphImpl[N, V](val nodes: Traversable[N], val adjacent: N => Traversable[N], val weight: (N, N) => V)(using evidence$1: Numeric[V]) extends GenericGraph[N], Weighted[N, V]
Weighted graph implementation created from a nodes collection, an adjacent nodes function, and a weight function.
Attributes
- Graph
-
- Supertypes
Members list
Value members
Concrete methods
Whether the node has any adjacent nodes.
Inherited methods
Whether the graph contains the node.
The edges in the graph.
The number of edges in the graph.
The number of nodes in the graph.
The reverse of the graph.
Concrete fields
The adjacent nodes for each node.
The adjacent nodes for each node.
Attributes
The nodes in the graph.
The nodes in the graph.
Attributes
The weight of the edge between two nodes.
The weight of the edge between two nodes.
Attributes
In this article