The following Repository holds all the code that is required to find the shortest path between two points in a given Street Network and the vertex cover which means minimum number of vertices(or Traffic Lights) needed to cover all the streets in the Network.
-
Notifications
You must be signed in to change notification settings - Fork 0
Ashwin4514/ShortestPath_OptimizationSAT
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Finding Minimum Distance to reach Two points in a Street Network and Placing Minimum Traffic Signals Across a Street Network using Vertex Cover Optimization
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published