Code Duplication    Length = 26-27 lines in 2 locations

tests/algorithms/graphs/util.py 2 locations

@@ 104-130 (lines=27) @@
101
    return g
102
103
104
def create_digraph_4_strongly_connected_components():
105
    
106
    graph = Digraph(13)
107
    graph.add_edge(4, 2)
108
    graph.add_edge(2, 3)
109
    graph.add_edge(3, 2)
110
    graph.add_edge(6, 0)
111
    graph.add_edge(0, 1)
112
    graph.add_edge(2, 0)
113
    graph.add_edge(11, 12)
114
    graph.add_edge(12, 9)
115
    graph.add_edge(9, 10)
116
    graph.add_edge(9, 11)
117
    graph.add_edge(8, 9)
118
    graph.add_edge(10, 12)
119
    graph.add_edge(11, 4)
120
    graph.add_edge(4, 3)
121
    graph.add_edge(3, 5)
122
    graph.add_edge(7, 8)
123
    graph.add_edge(8, 7)
124
    graph.add_edge(5, 4)
125
    graph.add_edge(0, 5)
126
    graph.add_edge(6, 4)
127
    graph.add_edge(6, 9)
128
    graph.add_edge(7, 6)
129
    
130
    return graph
131
@@ 36-61 (lines=26) @@
33
    return g
34
35
36
def create_digraph():
37
    g = Digraph(13)
38
    g.add_edge(4, 2)
39
    g.add_edge(2, 3)
40
    g.add_edge(3, 2)
41
    g.add_edge(6, 0)
42
    g.add_edge(0, 1)
43
    g.add_edge(2, 0)
44
    g.add_edge(11, 12)
45
    g.add_edge(12, 9)
46
    g.add_edge(9, 10)
47
    g.add_edge(9, 11)
48
    g.add_edge(7, 9)
49
    g.add_edge(10, 12)
50
    g.add_edge(11, 4)
51
    g.add_edge(4, 3)
52
    g.add_edge(3, 5)
53
    g.add_edge(6, 8)
54
    g.add_edge(8, 6)
55
    g.add_edge(5, 4)
56
    g.add_edge(0, 5)
57
    g.add_edge(6, 4)
58
    g.add_edge(6, 9)
59
    g.add_edge(7, 6)
60
61
    return g
62
63
64
def create_dag():