Directed graph demo Draw a weighted directed graph with three nodes A, B and C such that the following properties hold:

• The graph has only 3 edges.
• The shortest path from A to B is of length 3.
• The shortest path from A to C is of length 4.
• The shortest path from B to C is of length 1.
• The shortest path from B to A is of length 5.
• There are no paths from C to either A or B

]]> 1 0 0 directed_graph 0 1 10, 20, ... 3 0 18 1 1 1 0 0 0 1024 1 # Check the set of nodes print(sorted(graph.keys())) ['A', 'B', 'C'] SHOW SHOW # Print connectivity (computed by # hidden all-pairs shortest path code). for src in 'ABC': for dest in 'ABC': if src != dest: d = distances[src, dest] print(src, dest, '-' if d == INF else d) A B 3 A C 4 B A 5 B C 1 C A - C B - SHOW # Check there are just 3 edges print(sum([len(edgelist) for edgelist in graph.values()])) 3 SHOW