Question

Code Challenge: Solve the Eulerian Path Problem. • Input: The adjacency list of a directed graph that has an Eulerian path. • Output: An Eulerian path in this graph. Extra Dataset and Test Datasets Sample Input: 0 -> 2 1 -> 3 2 -> 1 3 -> 0, 4 6 -> 3, 7 7 -> 8 8 -> 9 9 -> 6 Sample Output: 6->7->8->9->6->5->0->2->1->3->4

          Code Challenge: Solve the Eulerian Path Problem.
• Input: The adjacency list of a directed graph that has an Eulerian path.
• Output: An Eulerian path in this graph.
Extra Dataset and Test Datasets
Sample Input:
0 -> 2
1 -> 3
2 -> 1
3 -> 0, 4
6 -> 3, 7
7 -> 8
8 -> 9
9 -> 6
Sample Output:
6->7->8->9->6->5->0->2->1->3->4

Code Challenge: Solve the Eulerian Path Problem.
• Input: The adjacency list of a directed graph that has an Eulerian path.
• Output: An Eulerian path in this graph.
Extra Dataset and Test Datasets
Sample Input:
0 -> 2
1 -> 3
2 -> 1
3 -> 0, 4
6 -> 3, 7
7 -> 8
8 -> 9
9 -> 6
Sample Output:
6->7->8->9->6->5->0->2->1->3->4

Added by Calvin V.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Emily Himsel

Step 1

We can do this by creating a dictionary where the keys are the nodes and the values are lists of the nodes they are connected to. Show more…

Show all steps

Thanks for your feedback!

Please write a Python code to solve the code challenge. Please use the sample input and output. Code Challenge: Solve the Eulerian Path Problem Input: The adjacency list of a directed graph that has an Eulerian path Output: An Eulerian path in this graph Extra Dataset and Test Datasets Sample Input: 0->2 1->3 2->1 3->0 4->6,7 6->3,7 7->8 8->5 9->6 Sample Output: 6->7->8->9->6->5->3->0->2->1->4