Kahn's Algorithm | Topological Sort using BFS | Graph Data Structure | Kahn Algorithm

Kahn's Algorithm | Topological Sort using BFS | Graph Data Structure | Kahn Algorithm | DSAOne #80

Рет қаралды 28,471

Күн бұрын

Пікірлер: 47

@arambh-gaur Ай бұрын

You have comprehensively covered every single thing in this playlist that is required to solve most graph problems, hats off !!

@SunnyGupta00 2 жыл бұрын

class Solution { //Function to return list containing vertices in Topological order. static int[] topoSort(int V, ArrayList adj) { int indegree[]=new int[V]; for(ArrayListtemp:adj){ for(int i:temp){ indegree[i]++; } } ArrayListans=new ArrayList(); bfs(adj,indegree,ans); int finalans[]=new int[V]; int i=0; for(int j:ans){ finalans[i++]=j; } return finalans; } static void bfs(ArrayList adj,int in[],ArrayListans){ Queueq=new LinkedList(); for(int i=0;i0){ int temp=q.poll(); ans.add(temp); for(int i:adj.get(temp)){ in[i]--; if(in[i]==0){ q.add(i); } } } } }

@rutkarbhat9508 2 жыл бұрын

This playlist is Gold. Hats off bhaiya

@SagarBisen-kt8ex 9 ай бұрын

Thanks for this awesome explanation. Just one correction what if indegree[node] is not zero, to handle these cases, we have to add below piece of code : for (int i = 0; i < V; i++) { if (indegree[i] == 0) q.add(i); }

@MindsetMotivation75 2 жыл бұрын

This video is helpful for me . Thank you

@sarvjeet_singh_001 Жыл бұрын

serial numbering on video is very thoughtful decision of yours. really helpful thank you

@MangoLassiYT 2 жыл бұрын

thank you

@AnaghAngira 2 жыл бұрын

Very fast bhaiya thanku 🙏🙏

@saritaprasad4295 Жыл бұрын

appreciate your effort

@meetsoni1938 2 жыл бұрын

Most underrated video ever on KZbin 🔥🔥💯💯🚀

@SurajKumar-nz7dh 2 жыл бұрын

Bhaiya your video is very helpful... Please make it regularly...🙏🙏🙏

@Nitinnawkhare1234 2 жыл бұрын

Bhaiya ye dsa konse language me padha rahe he

@SurajKumar-nz7dh 2 жыл бұрын

@@Nitinnawkhare1234 C++

@deepnarayanbhagat9126 2 жыл бұрын

@@Nitinnawkhare1234 graph Java me implement kara h inhone 💕

@songlover4566 2 жыл бұрын

Sayad Sir ek digital board bhi le Lena chahiye aapko because ur teaching method is nice 👍

@AmeerHamza-mt5yi 2 жыл бұрын

Anuj bhai please make a series of aptitude for company interview this is the 1st round of most of the companies asked bahut chalega please make proper order cover every topic huge demand of every studuent technical bahut loge ne ban diya hai

@vcs649 Жыл бұрын

nice explanation👍

@shubhanganitayal8185 2 жыл бұрын

Please make a video on Edge removal in tree, remove an edge such that the product of the sum of weights of two subtrees is maximized.

@Sky-gk4qq 2 жыл бұрын

Bhai iske sath Kruskal, Prims aur Dijktra dal dena toh series mostly covered ho jayega.

@AnujBhaiya 2 жыл бұрын

Aaj hi aa jaengi prims and dijkstra's, stay tuned

@Sky-gk4qq 2 жыл бұрын

@@AnujBhaiya TYSM bhaiya

@ankurgarg5326 6 ай бұрын

Greeat video but i think there is no need of visited array in this function

@coolstuff9837 2 жыл бұрын

what is the use of making visited boolean .You haven't used it in the problem.

@harsha4048 Жыл бұрын

❤

@Premvarma01 2 жыл бұрын

There is typo error on line 95 I think it should be for(int e:ansList)

@pironobcoding 2 жыл бұрын

Bhaiya we have to add Degree[i]=-1; after adding that to queue otherwise it will give us runtime error. in the intial loop static void dfs(int [] Degree,int V, ArrayList result,ArrayList adj){ Queue q = new LinkedList(); for(int i=0;i