How to find the shortest path in a multi-route graph

Published: 21/10/2019
How to find the shortest path in a multi-route graph
Source: STACKOVERFLOW.COM

Consider a graph with V vertices and n routes (cars). Each path (car) starts from one vertex and traverses the V vertices just one time (there is not any loop in each route). In each iteration (i.e., time), just one route (car) can be in each of the vertices (no collision between vehicles). If it is not feasible (two cars collide each other), the route (car) sticks in its vertex on that iteration

Read more
Related news
Comment
FACEBOOK