RBaLa

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.