PRIM'S ALGORITHM || FINDING MINIMUM COST SPANNING TREE || DATA STRUCTURES
ฝัง
- เผยแพร่เมื่อ 12 ก.ย. 2024
- SPANNING TREE
Spanning Tree is a SUBGRAPH from Graph G(V , E) with no cycles
1. Spanning Tree should consists of all the vertices of Graph
2. If Graph is having N vertices then Spanning Tree must have N-1 Edges
3. Spanning Tree should not contain cycles
PRIM'S ALGORITHMS
Graph should be connected, weighted and undirected
Step-1 :
Consider any Vertex
Step-2:
Find all the edges from selected Vertex to all new vertices
Find Least Weighted Edge and include it in Tree
If selected Least Weighted Edge forms a cycle then discard it and consider next Least Weighted Edge and include it in Tree
Step-3:
Repeat Step-2 until all the vertices are included in Tree
---------------------------------------------------------------------------------------------------------------
DATA STRUCTURES
• INTRODUCTION TO DATA S...
JAVA PROGRAMMING
• CORE JAVA TUTORIAL FOR...
COMPILER DESIGN
• INTRODUCTION TO COMPIL...
AUTOMATA THEORY || THEORY OF COMPUTATION
• INTRODUCTION TO AUTOMA...
R PROGRAMMING
studio.youtube...
HTML TUTORIALS WITH IMPLEMENTATION || LEARN HTML IN 4 HOURS
• HTML TUTORIALS WITH IM...
LEARN CSS IN 3 HOURS || CASCADING STYLE SHEETS FOR BEGINNERS
• LEARN CSS IN 3 HOURS |...
JAVA SCRIPT FOR BEGINNERS IN 7 HOURS || LEARN JAVA SCRIPT IN 7 HOURS || JAVA SCRIPT
• JAVA SCRIPT FOR BEGINN...
XML (eXtensible Markup Language)
• XML (eXtensible Markup...
OPERATING SYSTEM
• OPERATING SYSTEM
ETHICAL HACKING
• Video
VI EDITOR BASICS IN LINUX / UNIX || LEARN VI EDITOR COMMANDS || LINUX || UNIX
• VI EDITOR BASICS IN LI...
HOW TO DOWNLOAD & INSTALL MySQL IN WINDOWS 10
• HOW TO DOWNLOAD & INST...
DATABASE MANAGEMENT SYSTEM
• DATABASE MANAGEMENT SY...
PYTHON PROGRAMS
• PYTHON PROGRAMS
C PROGRAMMING
• 01 - VARIABLES & CONST...
CORE JAVA TUTORIAL FOR BEGINNERS || LEARN CORE JAVA IN 15 HOURS || JAVA TUTORIALS FOR BEGINNERS
• CORE JAVA TUTORIAL FOR...
PYTHON TUTORIALS FOR BEGINNERS (తెలుగు లో)
• Python in One Shot(తెల...
PYTHON OOPS - MODULES - EXCEPTION HANDLING (తెలుగు లో)
• PYTHON - OOPS CONCEPTS...
PYTHON NUMPY TUTORIAL IN TELUGU (తెలుగు లో) || COMPLETE NUMPY TUTORIALS IN TELUGU
• PYTHON NUMPY TUTORIAL ...
PYTHON PANDAS TUTORIAL IN TELUGU (తెలుగు లో) || COMPLETE PANDAS TUTORIALS IN TELUGU || DATA SCIENCE
• PYTHON PANDAS TUTORIAL...
MATPLOTLIB LIBRARY - PYTHON PROGRAMMING (ENGLISH)
• MATPLOTLIB LIBRARY - P...
PYTHON DATABASE CONNECTIVITY - MYSQL & MS-EXCEL
• PYTHON DATABASE CONNEC...
DATA STRUCTURES USING PYTHON (ENGLISH)
• DATA STRUCTURES USING ...
----------------------------------------------------------------------------------------------
Instagram : / sundeepsaradhikanthety
10:53 that's not 2,. d f = 3
all the concepts that you have explained very well sir. thank you so much sir, and all the best for your future.
Great explanation but complete board is not shown and from D to E the edge cost is 2 in the third step
sir , can you implement this algorithm in python or c .please make a video sir
Very nice sir. Love your content.
thank you sir !! you did alot for us
Well explained sir
NICE SUPER EXCELLENT MOTIVATED
Well explained
Thank you so much sirrrrr 🥰
Df is 3
Come for a tour in Uganda,,,,,I will buy you a lion