Add a Floyd–Warshall algorithm example
Open
example
task
- Dominant language
- C++
- Stars
- 1.7k
- Forks
- 340
- PR merge metrics
- No merged PRs in 30d
Description
Add an example named `floyd_warshall` implementing the [Floyd–Warshall](http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm) all-pairs shortest path algorithm on a graph represented by an adjacency-matrix storing the edge weights.
##
Contributor guide
Assessment
This issue has not been assessed yet.