FilesExpand file tree

 master

/

BreadthFirstSearch.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

59 lines (50 loc) · 1.37 KB

 master

/

BreadthFirstSearch.java

Copy path

Top

File metadata and controls

• Code
• Blame

59 lines (50 loc) · 1.37 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

55

56

57

58

59

import java.util.Iterator;

import java.util.LinkedList;

import java.util.Queue;

public class BreadthFirstSearch {

public static void main(String args[])

{

Graph g = new Graph(4);

g.addEdge(0, 1);

g.addEdge(0, 2);

g.addEdge(1, 2);

g.addEdge(2, 0);

g.addEdge(2, 3);

g.addEdge(3, 3);

g.BFS(2);

}

}

class Graph {

private int numVertices;

private LinkedList<Integer> adj[];

private boolean[] visited;

private Queue<Integer> queue;

public Graph(int vertices) {

numVertices = vertices;

adj = new LinkedList[vertices];

visited = new boolean[vertices];

queue = new LinkedList<>();

for (int i = 0; i < vertices; i++)

adj[i] = new LinkedList<Integer>();

}

void addEdge(int src, int dest) {

adj[src].add(dest);

}

void BFS(int vertex) {

queue.clear();

queue.add(vertex);

visited[vertex] = true;

while(!queue.isEmpty()) {

vertex = queue.poll();

System.out.print(vertex + " ");

Iterator ite = adj[vertex].listIterator();

while (ite.hasNext()) {

int adj = (int) ite.next();

if (!visited[adj]) {

visited[adj] = true;

queue.add(adj);

}

}

}

}

}