Program that gets from user or randomly generates streets (multilinear segment approximation) with name and segment coordinates, gets the graph formed by the streets with intersections and adjacent street nodes as vertices, and finds shortest path (one of) between any 2 nodes of the resultant undirected and unweighted graph. Vertex Cover program uses miniSAT to find vertex cover in the graph generated.
What is the RBaLa/Streetmap GitHub project? Description: "Program that gets from user or randomly generates streets (multilinear segment approximation) with name and segment coordinates, gets the graph formed by the streets with intersections and adjacent street nodes as vertices, and finds shortest path (one of) between any 2 nodes of the resultant undirected and unweighted graph. Vertex Cover program uses miniSAT to find vertex cover in the graph generated.". Written in C++. Explain what it does, its main use cases, key features, and who would benefit from using it.
Question is copied to clipboard — paste it after the AI opens.
Clone via HTTPS
Clone via SSH
Download ZIP
Download master.zipReport bugs or request features on the Streetmap issue tracker:
Open GitHub Issues