Breadth First Search

Purple Team answered on March 7, 2022 Popularity 10/10 Helpfulness 2/10

answer Breadth First Search

related breadth first search tip

related Breadth-First Search (BFS)

related breadth first search js

Breadth First Search

Comment

graph = {
  '5' : ['3','7'],
  '3' : ['2', '4'],
  '7' : ['8'],
  '2' : [],
  '4' : ['8'],
  '8' : []
}

visited = [] # List for visited nodes.
queue = []     #Initialize a queue

def bfs(visited, graph, node): #function for BFS
  visited.append(node)
  queue.append(node)

  while queue:          # Creating loop to visit each node
    m = queue.pop(0) 
    print (m, end = " ") 

    for neighbour in graph[m]:
      if neighbour not in visited:
        visited.append(neighbour)
        queue.append(neighbour)

# Driver Code
print("Following is the Breadth-First Search")
bfs(visited, graph, '5')    # function calling

Popularity 10/10 Helpfulness 2/10 Language python

Source: favtutor.com

Tags: breadth-first-search python

Link to this answer
Share Copy Link

Contributed on Mar 07 2022

Purple Team

0 Answers Avg Quality 2/10

Closely Related Answers

breadth first search tip

Comment

remember for breadth first searches, you are putting the vertex of your graph into a queue and that determines the order they are travelled

Popularity 10/10 Helpfulness 2/10 Language whatever

Source: Grepper

Tags: breadth-first-search breadth-first-se

Link to this answer
Share Copy Link

Contributed on Jul 25 2022

Javasper

0 Answers Avg Quality 2/10

Breadth-First Search (BFS)

Comment

import java.util.*;

public class BreadthFirstSearch {

    public static void main(String[] args) {
        int numVertices = 7;
        List<List<Integer>> graph = new ArrayList<>();

        // Initialize the graph
        for (int i = 0; i < numVertices; i++) {
            graph.add(new ArrayList<>());
        }

        // Add edges
        addEdge(graph, 0, 1);
        addEdge(graph, 0, 2);
        addEdge(graph, 1, 3);
        addEdge(graph, 1, 4);
        addEdge(graph, 2, 5);
        addEdge(graph, 2, 6);

        // Perform BFS traversal
        System.out.println("BFS Traversal:");
        bfs(graph, 0);
    }

    public static void addEdge(List<List<Integer>> graph, int u, int v) {
        graph.get(u).add(v);
        graph.get(v).add(u);
    }

    public static void bfs(List<List<Integer>> graph, int source) {
        int numVertices = graph.size();
        boolean[] visited = new boolean[numVertices];
        Queue<Integer> queue = new LinkedList<>();

        visited[source] = true;
        queue.add(source);

        while (!queue.isEmpty()) {
            int vertex = queue.poll();
            System.out.print(vertex + " ");

            for (int neighbor : graph.get(vertex)) {
                if (!visited[neighbor]) {
                    visited[neighbor] = true;
                    queue.add(neighbor);
                }
            }
        }
    }
}

Popularity 10/10 Helpfulness 1/10 Language java

Source: chat.openai.com

Tags: java

Link to this answer
Share Copy Link

Contributed on Jun 20 2023

Nirmal Majhi

0 Answers Avg Quality 2/10

breadth first search js

Comment

Breadth First Search Simply Takes a Data Tree or Nested Arrays Like testData. It sorts through the data and looks for its key value.

var testData = [[24,2,432,4,213,4,7,124],[12,412,56,4,63,324,6],[5,3,5436,32,345]]

function breadFirstSearch(key){
	for (i = 0; i < testData.length; i++){
		for (x = 0; x < testData[i].length; x++){
			if(testData[i][x] == key){
				console.log("Key Location: "+i+","+x)
			}
		}
	}
}

breadFirstSearch(5)

Popularity 10/10 Helpfulness 1/10 Language javascript

Source: Grepper

Tags: breadth-first-search breadth-first-se

Link to this answer
Share Copy Link

Contributed on Mar 14 2023

Crispyrice

0 Answers Avg Quality 2/10

Breadth First Search

Contents

More Related Answers

Breadth First Search

Closely Related Answers

breadth first search tip

Breadth-First Search (BFS)

breadth first search js

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.