create_dag() - Code Metrics - Inspection of "Implement topological sort" - chen0040/pyalgs - Measure and Improve Code Quality continuously with Scrutinizer

Passed

Push — master ( 500623...be817c )

by Xianshun

created 2017-04-26 13:31 UTC

create_dag() A

↳ Parent: Project

Complexity

Conditions

Size

Total Lines

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

Metric	Value
cc	1
c	1
b	0
f	0
dl	0
loc	16
rs	9.4285

from pyalgs.data_structures.graphs.graph import Graph, Digraph


def create_graph():
    g = Graph(6)
    g.add_edge(0, 5)
    g.add_edge(2, 4)
    g.add_edge(2, 3)
    g.add_edge(1, 2)
    g.add_edge(0, 1)
    g.add_edge(3, 4)
    g.add_edge(3, 5)
    g.add_edge(0, 2)

    return g


def create_graph_4_connected_components():
    g = Graph(13)
    g.add_edge(0, 5)
    g.add_edge(4, 3)
    g.add_edge(0, 1)
    g.add_edge(9, 12)
    g.add_edge(6, 4)
    g.add_edge(5, 4)
    g.add_edge(0, 2)
    g.add_edge(11, 12)
    g.add_edge(9, 10)
    g.add_edge(0, 6)
    g.add_edge(7, 8)
    g.add_edge(9, 11)
    g.add_edge(5, 3)
    return g
   

def create_digraph():
    g = Digraph(13)
    g.add_edge(4,  2)
    g.add_edge(2,  3)
    g.add_edge(3,  2)
    g.add_edge(6,  0)
    g.add_edge(0,  1)
    g.add_edge(2,  0)
    g.add_edge(11, 12)
    g.add_edge(12,  9)
    g.add_edge(9, 10)
    g.add_edge(9, 11)
    g.add_edge(7,  9)
    g.add_edge(10, 12)
    g.add_edge(11,  4)
    g.add_edge(4,  3)
    g.add_edge(3,  5)
    g.add_edge(6,  8)
    g.add_edge(8,  6)
    g.add_edge(5,  4)
    g.add_edge(0,  5)
    g.add_edge(6,  4)
    g.add_edge(6,  9)
    g.add_edge(7,  6)
    
    return g
   
   
def create_dag():
    dag = Digraph(7)

    dag.add_edge(0, 5)
    dag.add_edge(0, 2)
    dag.add_edge(0, 1)
    dag.add_edge(3, 6)
    dag.add_edge(3, 5)
    dag.add_edge(3, 4)
    dag.add_edge(5, 4)
    dag.add_edge(6, 4)
    dag.add_edge(6, 0)
    dag.add_edge(3, 2)
    dag.add_edge(1, 4)

    return dag

1			from pyalgs.data_structures.graphs.graph import Graph, Digraph
2
3
4			def create_graph():
5			g = Graph(6)
6			g.add_edge(0, 5)
7			g.add_edge(2, 4)
8			g.add_edge(2, 3)
9			g.add_edge(1, 2)
10			g.add_edge(0, 1)
11			g.add_edge(3, 4)
12			g.add_edge(3, 5)
13			g.add_edge(0, 2)
14
15			return g
16
17
18			def create_graph_4_connected_components():
19			g = Graph(13)
20			g.add_edge(0, 5)
21			g.add_edge(4, 3)
22			g.add_edge(0, 1)
23			g.add_edge(9, 12)
24			g.add_edge(6, 4)
25			g.add_edge(5, 4)
26			g.add_edge(0, 2)
27			g.add_edge(11, 12)
28			g.add_edge(9, 10)
29			g.add_edge(0, 6)
30			g.add_edge(7, 8)
31			g.add_edge(9, 11)
32			g.add_edge(5, 3)
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():
65			dag = Digraph(7)
66
67			dag.add_edge(0, 5)
68			dag.add_edge(0, 2)
69			dag.add_edge(0, 1)
70			dag.add_edge(3, 6)
71			dag.add_edge(3, 5)
72			dag.add_edge(3, 4)
73			dag.add_edge(5, 4)
74			dag.add_edge(6, 4)
75			dag.add_edge(6, 0)
76			dag.add_edge(3, 2)
77			dag.add_edge(1, 4)
78
79			return dag

chen0040 / pyalgs

Push — master ( 500623...be817c )

create_dag() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like