Skip to content
master
Switch branches/tags
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 
 
 
 
 

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.

About

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

Resources

License

Releases

No releases published

Packages

No packages published

Languages