Graph/BFS.py at master · Addy209/Graph · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
from AdjacencyList import AList
from Queue import Queue
class BFS:

    def __init__(self) -> None:
        self.alist=None
        num=self.initilize()
        self.visited=[-1]*num
        self.Queue=Queue(10*num)

    def initilize(self):
        num=5
        self.alist=AList(num)
        self.alist.insert(0,2)
        self.alist.insert(0,3)
        self.alist.insert(1,3)
        self.alist.insert(1,4)
        self.alist.insert(2,3)
        self.alist.insert(3,4)

        self.alist.print_graph()
        return num

    def BFS_Start(self, node):
        print("BFS Sequence is: ==> ",end="")
        self.visited[node]=0
        print(node,"==>",end="")
        k=self.alist.aL[node]
        while k:
            self.Queue.insert(k.nodeVal)
            k=k.next

        self.visited[node]=1

        while not self.Queue.isEmpty:
            u=self.Queue.delete()
            if self.visited[u]==-1:
                self.visited[u]=0
                print(u,end="==>")
                k=k=self.alist.aL[u]
                while k:
                    self.Queue.insert(k.nodeVal)
                    k=k.next
                self.visited[u]=1


bfs=BFS()
bfs.BFS_Start(0)