Code Duplication    Length = 20-37 lines in 2 locations

tests/algorithms/graphs/util.py 2 locations

@@ 105-141 (lines=37) @@
102
    return g
103
104
105
def create_edge_weighted_digraph():
106
    g = DirectedEdgeWeightedGraph(8)
107
108
    g.add_edge(
109
        Edge(0, 1, 5.0))
110
    g.add_edge(
111
        Edge(0, 4, 9.0))
112
    g.add_edge(
113
        Edge(0, 7, 8.0))
114
    g.add_edge(
115
        Edge(1, 2, 12.0))
116
    g.add_edge(
117
        Edge(1, 3, 15.0))
118
    g.add_edge(
119
        Edge(1, 7, 4.0))
120
    g.add_edge(
121
        Edge(2, 3, 3.0))
122
    g.add_edge(
123
        Edge(2, 6, 11.0))
124
    g.add_edge(
125
        Edge(3, 6, 9.0))
126
    g.add_edge(
127
        Edge(4, 5, 5.0))
128
    g.add_edge(
129
        Edge(4, 6, 20.0))
130
    g.add_edge(
131
        Edge(4, 7, 5.0))
132
    g.add_edge(
133
        Edge(5, 2, 1.0))
134
    g.add_edge(
135
        Edge(5, 6, 13.0))
136
    g.add_edge(
137
        Edge(7, 5, 6.0))
138
    g.add_edge(
139
        Edge(7, 2, 7.0))
140
141
    return g
142
143
144
def create_digraph_4_strongly_connected_components():
@@ 83-102 (lines=20) @@
80
    return dag
81
82
83
def create_edge_weighted_graph():
84
    g = EdgeWeightedGraph(8)
85
    g.add_edge(Edge(0, 7, 0.16))
86
    g.add_edge(Edge(2, 3, 0.17))
87
    g.add_edge(Edge(1, 7, 0.19))
88
    g.add_edge(Edge(0, 2, 0.26))
89
    g.add_edge(Edge(5, 7, 0.28))
90
    g.add_edge(Edge(1, 3, 0.29))
91
    g.add_edge(Edge(1, 5, 0.32))
92
    g.add_edge(Edge(2, 7, 0.34))
93
    g.add_edge(Edge(4, 5, 0.35))
94
    g.add_edge(Edge(1, 2, 0.36))
95
    g.add_edge(Edge(4, 7, 0.37))
96
    g.add_edge(Edge(0, 4, 0.38))
97
    g.add_edge(Edge(6, 2, 0.4))
98
    g.add_edge(Edge(3, 6, 0.52))
99
    g.add_edge(Edge(6, 0, 0.58))
100
    g.add_edge(Edge(6, 4, 0.93))
101
102
    return g
103
104
105
def create_edge_weighted_digraph():