Digraph

Complexity

Total Complexity

7

Size/Duplication

Total Lines	24
Duplicated Lines	100 %

Importance

Changes	1
Bugs	0	Features	0

5 Methods

Rating	Name	Duplication	Size	Complexity
A	add_edge()	2	2	1
A	vertex_count()	2	2	1
A	reverse()	7	7	3
A	adj()	2	2	1
A	__init__()	3	3	1

from pyalgs.data_structures.commons.bag import Bag


class Graph(object):

This code seems to be duplicated in your project.

    V = 0
    adjList = None

    def __init__(self, V):
        self.V = V
        self.adjList = [Bag()] * V

    def vertex_count(self):
        return self.V

    def adj(self, v):
        return self.adjList[v].iterate()

    def add_edge(self, v, w):
        self.adjList[v].add(w)
        self.adjList[w].add(v)


class Digraph(object):

This code seems to be duplicated in your project.

    V = 0
    adjList = None

    def __init__(self, V):
        self.V = V
        self.adjList = [Bag()] * V

    def vertex_count(self):
        return self.V

    def adj(self, v):
        return self.adjList[v].iterate()

    def add_edge(self, v, w):
        self.adjList[v].add(w)

    def reverse(self):
        g = Digraph(self.V)
        for v in range(self.V):
            for w in self.adjList[v].iterate():
                g.add_edge(w, v)

        return g