Prim's Algorithm Part-1 For Minimum Spanning Tree Explained With Solved Example in Hindi
HTML-код
- Опубликовано: 21 окт 2024
- 📚📚📚📚📚📚📚📚
GOOD NEWS FOR COMPUTER ENGINEERS
INTRODUCING
5 MINUTES ENGINEERING
🎓🎓🎓🎓🎓🎓🎓🎓
SUBJECT :-
Discrete Mathematics (DM)
Theory Of Computation (TOC)
Artificial Intelligence(AI)
Database Management System(DBMS)
Software Modeling and Designing(SMD)
Software Engineering and Project Planning(SEPM)
Data mining and Warehouse(DMW)
Data analytics(DA)
Mobile Communication(MC)
Computer networks(CN)
High performance Computing(HPC)
Operating system
System programming (SPOS)
Web technology(WT)
Internet of things(IOT)
Design and analysis of algorithm(DAA)
💡💡💡💡💡💡💡💡
EACH AND EVERY TOPIC OF EACH AND EVERY SUBJECT (MENTIONED ABOVE) IN COMPUTER ENGINEERING LIFE IS EXPLAINED IN JUST 5 MINUTES.
💡💡💡💡💡💡💡💡
THE EASIEST EXPLANATION EVER ON EVERY ENGINEERING SUBJECT IN JUST 5 MINUTES.
🙏🙏🙏🙏🙏🙏🙏🙏
YOU JUST NEED TO DO
3 MAGICAL THINGS
LIKE
SHARE
&
SUBSCRIBE
TO MY RUclips CHANNEL
5 MINUTES ENGINEERING
📚📚📚📚📚📚📚📚
Thanku guru g for good explanation.
I think this is dijikshtra algo
Nice explaination sir
Thank you so much
Hello sir today is my soft computing exam wish me good luck :)
All the best bro
All the best bro
Good Luck
@@5MinutesEngineering ty sir 🙏🙌😁
30 December se exams start horahy hain, kindly algorithms ko jaldi se hatam kardo. specially graph
Super
Thanks
Thanks sir
#nothing but good
Ye Dijkstra algorithm h Sir 🌚
Barabar hai
God among men 🗿
bhaiyya ye video kayse last mein hatam hogai?
Ye dijkang hai na
Complex
thoda jyada ho gaya.