#188 is started

Author: Hamid Gasmi

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle.py

@@ -0,0 +1,21 @@
+import sys
+
+
+def eulerian_cycle(graph):
+    """Finds an Eulerian cycle in the given graph
+
+    Args:
+        graph:      a list of strings containing edges in the graph; one
+                    string may correspond to multiple edges if it is of the
+                    form "X -> Y,Z"
+
+    Returns:
+        a string containing an Eulerian cycle through the given graph
+    """
+    # TODO: your code here
+    return ""
+
+
+if __name__ == "__main__":
+    graph = sys.stdin.read().strip().splitlines()
+    print(eulerian_cycle(graph))

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/01.exp

@@ -0,0 +1 @@
+3->2->6->8->7->9->6->5->4->2->1->0->3

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/01.in

@@ -0,0 +1,10 @@
+0 -> 3
+1 -> 0
+2 -> 1,6
+3 -> 2
+4 -> 2
+5 -> 4
+6 -> 5,8
+7 -> 9
+8 -> 7
+9 -> 6

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/02.exp

@@ -0,0 +1 @@
+0->1->2->0

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/02.in

@@ -0,0 +1,3 @@
+0 -> 1
+1 -> 2
+2 -> 0

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/03.exp

@@ -0,0 +1 @@
+0->3->0->1->2->0

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/03.in

@@ -0,0 +1,4 @@
+0 -> 3,1
+1 -> 2
+2 -> 0
+3 -> 0

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/04.exp

@@ -0,0 +1 @@
+4->1->2->0->1->3->4

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/04.in

@@ -0,0 +1,5 @@
+0 -> 1
+1 -> 2,3
+2 -> 0
+3 -> 4
+4 -> 1

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/05.exp

@@ -0,0 +1 @@
+2->2->1->2

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/05.in

@@ -0,0 +1,2 @@
+1 -> 2
+2 -> 1,2

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/06.exp

@@ -0,0 +1 @@
+1->10->4->5->10->3->10->2->1

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/06.in

@@ -0,0 +1,6 @@
+1 -> 10
+10 -> 2,3,4
+2 -> 1
+3 -> 10
+4 -> 5
+5 -> 10

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/07.exp

@@ -0,0 +1 @@
+3->4->3->1->3->0->2->0->4->0->3->2->1->0->1->2->4->1->4->2->

09-problems/graph-algorithms-in-genome-sequencing/eulerian_cycle_tests/07.in

@@ -0,0 +1,5 @@
+0 -> 1,2,3,4
+1 -> 0,2,3,4
+2 -> 0,1,3,4
+3 -> 0,1,2,4
+4 -> 0,1,2,3