Simple digraph SPT test

Enter graph:

{ "0": { "2" : 26, "4": 38 }, "1": { "3" : 29 }, "2": { "7" : 34 }, "3": { "6" : 52 }, "4": { "5" : 35, "7": 37 }, "5": { "7" : 28, "1": 32 }, "6": { "0" : 58, "2": 40, "4": 93 }, "7": { "3" : 39, "5": 28 }, "OtherA": {"OtherB" : 2 }, "OtherB": {} }

Start vertex:
End vertex:

Process graph above

Click button about to see results here
For default graph example above, expected results are the following:

Shortest path '0' ➔ '7': {"distance":60,"startId":"0","endId":"7","segments":["0→2","2→7"],"nodes":["0","2","7"],"feasible":true}

All 7 shortest paths from '0':
    [#1] ...➔ '1': {"distance":105,"startId":"0","endId":"1","segments":["0→4","4→5","5→1"],"nodes":["0","4","5","1"],"feasible":true}
    [#2] ...➔ '2': {"distance":26,"startId":"0","endId":"2","segments":["0→2"],"nodes":["0","2"],"feasible":true}
    [#3] ...➔ '3': {"distance":99,"startId":"0","endId":"3","segments":["0→2","2→7","7→3"],"nodes":["0","2","7","3"],"feasible":true}
    [#4] ...➔ '4': {"distance":38,"startId":"0","endId":"4","segments":["0→4"],"nodes":["0","4"],"feasible":true}
    [#5] ...➔ '5': {"distance":73,"startId":"0","endId":"5","segments":["0→4","4→5"],"nodes":["0","4","5"],"feasible":true}
    [#6] ...➔ '6': {"distance":151,"startId":"0","endId":"6","segments":["0→2","2→7","7→3","3→6"],"nodes":["0","2","7","3","6"],"feasible":true}
    [#7] ...➔ '7': {"distance":60,"startId":"0","endId":"7","segments":["0→2","2→7"],"nodes":["0","2","7"],"feasible":true}

Grid graphs

Start vertex:
End vertex: (common syntax: 'Vxx|yy')
Grid width:
Grid height:
Straigh weight:
Diagonal weight:
Include diagonals:

Process grid-based graph

Click button about to see results here