ranked_node_names = [['start'], [1, 2, 3], ['a', 'b', 'c'], ['end']]
node_edges = [('start', 2), ('start', 3), (2, 'b'), ('b', 'end'), ('a', 'end')]
G = nx.DiGraph()
python drawing directed graph in SPYDER