GeezerVison is showing github.com — Java/Programs/BreathFirstSearch.java at main · arshcoder13/Java

Expand file tree

BreathFirstSearch.java

Copy path

More file actions

Latest commit

History

61 lines (47 loc) · 1.12 KB

BreathFirstSearch.java

Copy path

File metadata and controls

61 lines (47 loc) · 1.12 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

// BFS algorithm in Java

import java.util.*;

public class Graph {

private int V;

private LinkedList<Integer> adj[];

// Create a graph

Graph(int v) {

V = v;

adj = new LinkedList[v];

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

adj[i] = new LinkedList();

}

// Add edges to the graph

void addEdge(int v, int w) {

adj[v].add(w);

}

// BFS algorithm

void BFS(int s) {

boolean visited[] = new boolean[V];

LinkedList<Integer> queue = new LinkedList();

visited[s] = true;

queue.add(s);

while (queue.size() != 0) {

s = queue.poll();

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

Iterator<Integer> i = adj[s].listIterator();

while (i.hasNext()) {

int n = i.next();

if (!visited[n]) {

visited[n] = true;

queue.add(n);

}

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);

System.out.println("Following is Breadth First Traversal " + "(starting from vertex 2)");

g.BFS(2);

}