DSA | Unit 3 | Graphs | SPPU S.E. Comp & A.I. | ONESHOT
Автор: Haris Chaus
Загружено: 2025-04-17
Просмотров: 42131
Notes Link: https://rzp.io/rzp/sw4MwjTn
Notes are in online format.
Instagram: / harischaus
LinkedIn: / haris-chaus-721734208
Basic Concepts of Graphs
Storage Representation:
Adjacency Matrix
Adjacency List
Adjacency Multi List
Inverse Adjacency List
Traversals:
Depth First
Breadth First
Minimum Spanning Tree:
Greedy Algorithms For Computing Minimum Spanning Tree
Prims And Kruskal Algorithms
Dikjtra's Single Source Shortest Path
All Pairs Shortest Paths:
Floyd-Warshall Algorithm
Topological Ordering
DSA Oneshot
Graphs Oneshot
Data Structures and Algorithms for Endsem
SPPU Endsem Exam
DSA Endsem Exam
SPPU Endsem Exam
Computer Engineering
Artificial Intelligence and Data Science
Timestamp:
0:00 Introduction
0:41 Basic Concepts
2:47 Types of Graphs
13:57 Properties of Graphs
19:27 Difference between Tree and Graph
22:29 Applications of Graphs
25:20 Storage Representation
25:36 Adjacency Matrix
37:26 Adjacency List
43:57 Adjacency Multi List
51:51 Inverse Adjacency List
53:44 Example
1:06:32 Depth First Search
1:33:04 Breadth First Search
1:44:47 Minimum Spanning Tree
1:46:46 Prim's Algorithm
1:58:52 Kruskal's Algorithm
2:10:43 Difference between Prim and Kruskal
2:12:11 Dijkstra's Algorithm
2:27:59 Floyd Warshall's Algorithm
2:41:57 Topological Ordering
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
