Directed Graph Structure problem

Puzzle problem that takes a directed graph as input and returns information about the possible routes on the graph.

Directed Graph uses Dijkstra's algorithm to find shortest path.

Input format is: AB5, BC4, CD8, DC8, DE6, AD5, CE2, EB3, AE7