Shortest path finding for multiple points in 2d ware house

39 Views Asked by At

2d ware house layout in 2d layout task is to find shortest distance for getting material from storage points Z00 ,Z01 .... may be start or end points based on user input A1A1 B1A1 ....are storage points Only horizontal and vertical movement is allowed ( NO diagonal movement to reach storage points) Assuming distance between each block is 1 (one ) meter Task is to find shortest distance Start from Z00 visit A1A1 , C1A4 and end at Z02

I am using networkx. Not able to find correct layout for visuals of layout and distance for multiple visit points also

0

There are 0 best solutions below