GitHub / mike-liuliu / Algorithm_4
Source code of the paper "An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph."
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mike-liuliu%2FAlgorithm_4
Stars: 8
Forks: 0
Open issues: 0
License: apache-2.0
Language: Jupyter Notebook
Size: 3.05 MB
Dependencies parsed at: Pending
Created at: 10 months ago
Updated at: 18 days ago
Pushed at: 18 days ago
Last synced at: 18 days ago
Topics: all-pairs-shortest-path, all-points-path-distance, bottleneck-edge-query-problem, floyd-warshall-algorithm, longest-leg-path-distance, maximum-capacity-path-problem, min-max-jump-distance, minimax-path-problem, minimum-spanning-tree, shortest-path-problem, widest-path-problem