Learn Breadth First Search in 6 minutes ↔️ 

public class Main { public static void main(String[] args) { // Breadth FS = Traverse a graph level by level // Utilizes a Queue // Better if destination is on average close to start // Siblings are visited before children // Depth FS = Traverse a graph branch by branch // Utilizes a Stack // Better if destination is on average far from the start // Children are visited before siblings // More popular for games/puzzles Graph graph = new Graph(5); graph.addNode(new Node('A')); graph.addNode(new Node('B')); graph.addNode(new Node('C')); graph.addNode(new Node('D')); graph.addNode(new Node('E')); graph.addEdge(0, 1); graph.addEdge(1, 2); graph.addEdge(1, 4); graph.addEdge(2, 3); graph.addEdge(2, 4); graph.addEdge(4, 0); graph.addEdge(4, 2); graph.print(); graph.breadthFirstSearch(0); } } import java.util.*; public class Graph { ArrayList nodes; int[][] matrix; Graph(int size){ nodes = new ArrayList(); matrix = new int[size][size]; } public void addNode(Node node) { nodes.add(node); } public void addEdge(int src, int dst) { matrix[src][dst] = 1; } public boolean checkEdge(int src, int dst) { if(matrix[src][dst] == 1) { return true; } else { return false; } } public void print() { System.out.print(" "); for(Node node : nodes) { System.out.print(node.data + " "); } System.out.println(); for(int i = 0; i < matrix.length; i++) { System.out.print(nodes.get(i).data + " "); for(int j = 0; j < matrix[i].length; j++) { System.out.print(matrix[i][j] + " "); } System.out.println(); } System.out.println(); } public void breadthFirstSearch(int src) { Queue queue = new LinkedList(); boolean[] visited = new boolean[matrix.length]; queue.offer(src); visited[src] = true; while(queue.size() != 0) { src = queue.poll(); System.out.println(nodes.get(src).data + " = visited"); for(int i = 0; i < matrix[src].length; i++) { if(matrix[src][i] == 1 && !visited[i]) { queue.offer(i); visited[i] = true; } } } } } public class Node { char data; Node(char data){ this.data = data; } }

Been watching your videos all year and now you're really saving me from my Discrete math class.

Most underrated coding channel on RU-vid

I am confused with why does my lecture needs 40minutes to explain this and I could not understand anything he talked about.

Hey Make React Js Course bro with node js backend

sweeeet

Good 👍👍

Can you do a tutorial for Dijkstra's Algorithm

my bro your student is here

Bro please make a design and analysis of algorithms, playlist

I've been trying to figure out how to implement this for a couple of days now until your video popped up, thank you so much. So many explanations are incredibly technical and don't really explain the practicality of it very well

great vid!

Hey Bro can you do some more C# videos? For example LINQ queries ?

Hey bro, can you make a guide for JPackage (making an installable .exe out of a .jar) I've seen many tutorials and docs but still have problems with it

Hello

Where did my comment go?

Hey bro, what's your microphone by chance

Informative and easy to understand! Good points in the end too

I'm early today

Thanks!

Thanks for the tutorial bro. 😇

you're really good !!

You are the best:)

Super

Another session with the Brofessor. Class is in Session.

Bro code, I'm learning python ( watching your 12h course) and I got an idea to do a brute force attack on a website, I searched on github and youtube but when I try the code it doesn't work. Can you do a video on how to do a brute force attack and what are python libraries and how they work?

ഒരു ഹലോ തരാമോ 🌚

:((

Hello bro, really appreciate what you are doing. I want to ask if you have any knowledge about machine learning field, please make video about it. Thank you

I'm a bit heartbroken. This video didn't start with "Hey everyone, it's your bro". :(

thanks bro 🙏 waiting for more & more turtorials !!