Skip to content

It calculates node and link and shortest distance between two point using Dijkstra algorithm.

License

Notifications You must be signed in to change notification settings

Shubham0a/Transportation-node-and-link-calculation

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

31 Commits
 
 
 
 
 
 

Repository files navigation

Transportation

node-and-link-calculation

minimum distance between each node calculation

min-distance

Installation

Use the package manager pip to install osm file converter to csv file.

pip install osm2gmns

special thanks to: openstreetmap and Jiawei Lu, Xuesong (Simon) Zhou and some other scources which helped me

Usage

Download map.osm file from openstreet link*

Use method as follows:-

  1. Open the website of openstreet from the link*.
  1. Go to export ans select the location.
  1. export the osm file.
  1. run the scource code with map.osm Note: Both should be in same directory
  1. run transportation.exe file (i was unable to upload due to big size so you can download from here or you may mail me to get it on shubhamiit30@gmail.com) note: please download the folder named transport and add map.osm file in dist folder and then run transportation.exe in dist folder.
  1. distance.txt file will be created which contains minimum distance corresponding to each node.
import os
import csv

import osm2gmns as og

.
.
.
.

with open('link.csv') as csv_file:
.
.

Contact Me

Feel free to contact me:-

JOIN ME

Contributing

Pull requests are welcome. For major changes, please open an issue first to discuss what you would like to change.

Please make sure to update tests as appropriate.

License

MIT

About

It calculates node and link and shortest distance between two point using Dijkstra algorithm.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages