https://github.com/filipporanza/all_shortest_path

Floyd-Warshall Algorithm implementation
https://github.com/filipporanza/all_shortest_path

all-shortest-path floyd-warshall-algorithm graph minimal-spanning-tree

Last synced: about 1 month ago
JSON representation

Floyd-Warshall Algorithm implementation

• Host: GitHub
• URL: https://github.com/filipporanza/all_shortest_path
• Owner: FilippoRanza
• License: mit
• Created: 2021-12-15T09:07:07.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2021-12-15T15:10:58.000Z (about 3 years ago)
• Last Synced: 2024-12-06T09:18:49.070Z (about 2 months ago)
• Topics: all-shortest-path, floyd-warshall-algorithm, graph, minimal-spanning-tree
• Language: Rust
• Homepage: https://crates.io/crates/all_shortest_path
• Size: 5.86 KB
• Stars: 0
• Watchers: 3
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# all_shortest_path

![example workflow](https://github.com/FilippoRanza/all_shortest_path/actions/workflows/rust.yml/badge.svg)

![crates.io](https://img.shields.io/crates/v/all_shortest_path.svg)

[![License: MIT](https://img.shields.io/badge/License-MIT-blue.svg)](https://opensource.org/licenses/MIT)

Floyd-Warshall Algorithm implementation

## Description 

`all_shortest_path` provides a simple [Floyd-Warshall](https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm) implementation.