Dijkstra's Solver

Graph JSON (list representation):
{ "A": {"T": 80, "N": 30}, "T": {"J": 50, "R": 15, "G":10}, "J": {}, "R": {"J": 20}, "G": {"R": 45, "E": 5}, "E": {"T": 8, "R": 15}, "N": {"T": 42, "G": 25, "E": 32} } Starting Node: A E G J N R T Order: alpha alpha-reverse distance-min-max distance-max-min Calculate!