vertices are distinct.

A weighted directed graph associates a value (weight) with every edge in the directed graph. The weight of a directed walk (or trail or path) in a weighted directed graph is the sum of the weights of the traversed edges. Sometimes the words cost or length are used instead of weight.

Examples

* A graph is connected if there are paths containing each pair of vertices.
* A directed graph is strongly connected

1.Previous
3.Next