Introduction to Graphs Data Structure
Graphs are a non-linear data structure that consists of a finite set of vertices (nodes) and a set of edges connecting them.
In this video, I have introduced the basics, applications, properties and the terminology related to graphs.
00:00 Introduction
00:23 Data Structure
01:20 Graphs
02:34 Applications
06:30 Graph properties
07:05 Connected / Disconnected graph
08:33 Directed / Undirected graph
09:58 Weighted graph
12:21 Cyclic / Acyclic graph
14:05 Dense / Sparse graph
15:03 Simple / Complete graph
16:38 Strongly connected graph
17:41 Terminology (Adjacency, Degree, Path, Cycle, Walk)
-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------
For in-depth Graph theory and implementation details, please refer to the below videos:
Graphs Introduction: https://www.youtube.com/watch?v=4xMsNIPEkwA
Graph representation:
Adjacency Matrix: https://www.youtube.com/watch?v=x6N5FK6ArRk
Adjacency List: https://www.youtube.com/watch?v=3AtEzK4sowk
Incidence Matrix: https://www.youtube.com/watch?v=bP-8P8f8mAY
Traversal techniques:
BFS, Breadth First Search: https://www.youtube.com/watch?v=iYz-pG1CPIM
DFS, Depth First Search: https://www.youtube.com/watch?v=oO1857MQlcs
Shortest Path algorithms:
Dijkstra algorithm: https://www.youtube.com/watch?v=J12sfRYpW-M
Bellman Ford algorithm: https://www.youtube.com/watch?v=iGzZEJc_w3I
Floyd Warshall algorithm: https://www.youtube.com/watch?v=R0Srbd5ALN8
Minimum Spanning Tree:
Kruskal algorithm: https://www.youtube.com/watch?v=dYIWheKq5Xc
Prim algorithm: https://www.youtube.com/watch?v=NCpUwOqt41k
Topological sort (Kahn algorithm): https://www.youtube.com/watch?v=gDNm1m3G4wo
Articulation points / Cut vertices:
Tarjan algorithm: https://www.youtube.com/watch?v=qNVNoZJFp_g
Disjoint Set / Union Find: https://www.youtube.com/watch?v=0JE7hxr8c5c
Maximum Flow Problem:
Ford Fulkerson algorithm: https://www.youtube.com/watch?v=_UcOALraATY
Graph coloring / Chromatic number: https://www.youtube.com/watch?v=oikZlz1GNbo
Hamiltonian cycle: https://www.youtube.com/watch?v=jGRRBJlNtwI
Euler cycle (Fleury algorithm): https://www.youtube.com/watch?v=c0e50JIAMuM
#DataStructure,#Graphs,#FitCoder,#Algorithm,#competitiveprogramming
Видео Introduction to Graphs Data Structure канала Fit Coder
In this video, I have introduced the basics, applications, properties and the terminology related to graphs.
00:00 Introduction
00:23 Data Structure
01:20 Graphs
02:34 Applications
06:30 Graph properties
07:05 Connected / Disconnected graph
08:33 Directed / Undirected graph
09:58 Weighted graph
12:21 Cyclic / Acyclic graph
14:05 Dense / Sparse graph
15:03 Simple / Complete graph
16:38 Strongly connected graph
17:41 Terminology (Adjacency, Degree, Path, Cycle, Walk)
-------------------------------------------------------------
I live in New Delhi and love explaining programming concepts. I have done M.Tech(BITS Pilani) + B.Tech(PEC, Chandigarh) in Computer Science and am currently working as a software engineer in a MNC.
If you like my content, please like, share my videos and subscribe to the channel.
-------------------------------------------------------------
For in-depth Graph theory and implementation details, please refer to the below videos:
Graphs Introduction: https://www.youtube.com/watch?v=4xMsNIPEkwA
Graph representation:
Adjacency Matrix: https://www.youtube.com/watch?v=x6N5FK6ArRk
Adjacency List: https://www.youtube.com/watch?v=3AtEzK4sowk
Incidence Matrix: https://www.youtube.com/watch?v=bP-8P8f8mAY
Traversal techniques:
BFS, Breadth First Search: https://www.youtube.com/watch?v=iYz-pG1CPIM
DFS, Depth First Search: https://www.youtube.com/watch?v=oO1857MQlcs
Shortest Path algorithms:
Dijkstra algorithm: https://www.youtube.com/watch?v=J12sfRYpW-M
Bellman Ford algorithm: https://www.youtube.com/watch?v=iGzZEJc_w3I
Floyd Warshall algorithm: https://www.youtube.com/watch?v=R0Srbd5ALN8
Minimum Spanning Tree:
Kruskal algorithm: https://www.youtube.com/watch?v=dYIWheKq5Xc
Prim algorithm: https://www.youtube.com/watch?v=NCpUwOqt41k
Topological sort (Kahn algorithm): https://www.youtube.com/watch?v=gDNm1m3G4wo
Articulation points / Cut vertices:
Tarjan algorithm: https://www.youtube.com/watch?v=qNVNoZJFp_g
Disjoint Set / Union Find: https://www.youtube.com/watch?v=0JE7hxr8c5c
Maximum Flow Problem:
Ford Fulkerson algorithm: https://www.youtube.com/watch?v=_UcOALraATY
Graph coloring / Chromatic number: https://www.youtube.com/watch?v=oikZlz1GNbo
Hamiltonian cycle: https://www.youtube.com/watch?v=jGRRBJlNtwI
Euler cycle (Fleury algorithm): https://www.youtube.com/watch?v=c0e50JIAMuM
#DataStructure,#Graphs,#FitCoder,#Algorithm,#competitiveprogramming
Видео Introduction to Graphs Data Structure канала Fit Coder
Показать
Комментарии отсутствуют
Информация о видео
Другие видео канала
Graph representation I - Adjacency Matrix Explained | Data StructureKruskal Algorithm | Minimum Spanning Tree | Greedy Algorithm | GraphsGraph Algorithms for Technical Interviews - Full CourseGraphs In Data Structures | Graph Representation In Data Structure | Data Structures | SimplilearnTerminologies of Graph | Data StructureRepresentation of Graphs - Adjacency List, Adjacency Matrix & Other RepresentationsDijkstra Algorithm | Single Source Shortest Path | Greedy Algorithm | GraphsWhat is a Graph Data Structure? When to use it? How to easily visualize it?Articulation Points | Cut Vertices | Tarjan's Algorithm | GraphsDisjoint Set | Union Find | Cycle Detection| Union By Rank | Path Compression | GraphsIntroduction to Linked List | Data StructureTopological Sort | Kahn vs DFS | Graphs | Data StructurePrim Algorithm | Minimum Spanning Tree | Greedy Algorithm | GraphsGraph representation II - Adjacency List Explained | Data StructureBellman Ford Algorithm | Single Source Shortest Path | Dynamic Programming | GraphsGraph and its representations | GeeksforGeeksBreadth First Search (BFS) Graph Traversal in Data StructuresAlgorithms Course - Graph Theory Tutorial from a Google EngineerBurn A Binary Tree | Interview Question