chen0040 /
pyalgs
| @@ 23-46 (lines=24) @@ | ||
| 20 | self.adjList[w].add(v) |
|
| 21 | ||
| 22 | ||
| 23 | class Digraph(object): |
|
| 24 | V = 0 |
|
| 25 | adjList = None |
|
| 26 | ||
| 27 | def __init__(self, V): |
|
| 28 | self.V = V |
|
| 29 | self.adjList = [Bag()] * V |
|
| 30 | ||
| 31 | def vertex_count(self): |
|
| 32 | return self.V |
|
| 33 | ||
| 34 | def adj(self, v): |
|
| 35 | return self.adjList[v].iterate() |
|
| 36 | ||
| 37 | def add_edge(self, v, w): |
|
| 38 | self.adjList[v].add(w) |
|
| 39 | ||
| 40 | def reverse(self): |
|
| 41 | g = Digraph(self.V) |
|
| 42 | for v in range(self.V): |
|
| 43 | for w in self.adjList[v].iterate(): |
|
| 44 | g.add_edge(w, v) |
|
| 45 | ||
| 46 | return g |
|
| 47 | ||
| @@ 4-20 (lines=17) @@ | ||
| 1 | from pyalgs.data_structures.commons.bag import Bag |
|
| 2 | ||
| 3 | ||
| 4 | class Graph(object): |
|
| 5 | V = 0 |
|
| 6 | adjList = None |
|
| 7 | ||
| 8 | def __init__(self, V): |
|
| 9 | self.V = V |
|
| 10 | self.adjList = [Bag()] * V |
|
| 11 | ||
| 12 | def vertex_count(self): |
|
| 13 | return self.V |
|
| 14 | ||
| 15 | def adj(self, v): |
|
| 16 | return self.adjList[v].iterate() |
|
| 17 | ||
| 18 | def add_edge(self, v, w): |
|
| 19 | self.adjList[v].add(w) |
|
| 20 | self.adjList[w].add(v) |
|
| 21 | ||
| 22 | ||
| 23 | class Digraph(object): |
|
