https://github.com/facebookresearch/many-to-many-dijkstra

A predictive model developed to identify medium-voltage electrical distribution grid infrastructure using publicly available data sources.
https://github.com/facebookresearch/many-to-many-dijkstra

Last synced: about 2 months ago
JSON representation

A predictive model developed to identify medium-voltage electrical distribution grid infrastructure using publicly available data sources.

• Host: GitHub
• URL: https://github.com/facebookresearch/many-to-many-dijkstra
• Owner: facebookresearch
• License: mit
• Archived: true
• Created: 2019-01-18T20:09:59.000Z (over 5 years ago)
• Default Branch: main
• Last Pushed: 2021-08-31T19:18:11.000Z (about 3 years ago)
• Last Synced: 2024-07-29T07:32:12.351Z (about 2 months ago)
• Language: Python
• Size: 19.4 MB
• Stars: 229
• Watchers: 13
• Forks: 37
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • Contributing: CONTRIBUTING
  • License: LICENSE
  • Code of conduct: CODE_OF_CONDUCT.md

Awesome Lists containing this project

README

        
# Pathfinder

A many-to-many variant of the Dijkstra's shortest distance algorithm.

Originally developed to predict the locations of medium-voltage electrical distribution grid infrastructure using publicly available data sources.

How pathfinder works is described in the Model Tutorial in this repo.

Notes on implementation and operation are embedded as comments within the code.

## License

Pathfinder is MIT licensed, as found in the LICENSE file.