(graph)
| 63 | |
| 64 | |
| 65 | def find_first_commit(graph): |
| 66 | first = None |
| 67 | for n in graph.nodes(): |
| 68 | if graph.in_degree(n) == 0: |
| 69 | if first is None: |
| 70 | first = n |
| 71 | else: |
| 72 | print("Multiple starting nodes is not supported.") |
| 73 | sys.exit() |
| 74 | return first |
| 75 | |
| 76 | |
| 77 | def depth_first_traverse(graph, first_commit): |
no test coverage detected