DepthFirstOrder.__init__() - 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

DepthFirstOrder.init() A

↳ Parent: DepthFirstOrder

Complexity

Conditions

Size

Total Lines

Duplication

Lines	0
Ratio	0 %

Importance

Changes	1
Bugs	0	Features	0

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

from pyalgs.data_structures.commons.stack import Stack


class DepthFirstOrder(object):

    marked = None
    reversePostOrder = None

    def __init__(self, G):
        self.reversePostOrder = Stack.create()
        vertex_count = G.vertex_count()
        self.marked = [False] * vertex_count

        for v in range(vertex_count):
            if not self.marked[v]:
                self.dfs(G, v)

    def dfs(self, G, v):
        self.marked[v] = True
        for w in G.adj(v):
            if not self.marked[w]:
                self.dfs(G, w)
        self.reversePostOrder.push(v)

    def postOrder(self):
        return self.reversePostOrder.iterate()

1			from pyalgs.data_structures.commons.stack import Stack
2
3
4			class DepthFirstOrder(object):
5
6			marked = None
7			reversePostOrder = None
8
9			def __init__(self, G):
10			self.reversePostOrder = Stack.create()
11			vertex_count = G.vertex_count()
12			self.marked = [False] * vertex_count
13
14			for v in range(vertex_count):
15			if not self.marked[v]:
16			self.dfs(G, v)
17
18			def dfs(self, G, v):
19			self.marked[v] = True
20			for w in G.adj(v):
21			if not self.marked[w]:
22			self.dfs(G, w)
23			self.reversePostOrder.push(v)
24
25			def postOrder(self):
26			return self.reversePostOrder.iterate()

chen0040 / pyalgs

Push — master ( 500623...be817c )

DepthFirstOrder.__init__() A

Complexity

Size

Duplication

Importance

Duplication Side-by-Side

Filter issues like

DepthFirstOrder.init() A