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: Introduction to Graphs Data Structure

Graph representation:
Adjacency Matrix: Graph representation I - Adjacency Ma...
Adjacency List: Graph representation II - Adjacency L...
Incidence Matrix: Graph representation III - Incidence ...

Traversal techniques:
BFS, Breadth First Search: BFS Breadth First Search | Graph Trav...
DFS, Depth First Search: DFS Depth First Search | Graph Traver...

Shortest Path algorithms:
Dijkstra algorithm: Dijkstra Algorithm | Single Source Sh...
Bellman Ford algorithm: Bellman Ford Algorithm | Single Sourc...
Floyd Warshall algorithm: Floyd Warshall Algorithm | All Pairs ...

Minimum Spanning Tree:
Kruskal algorithm: Kruskal Algorithm | Minimum Spanning ...
Prim algorithm: Prim Algorithm | Minimum Spanning Tre...

Topological sort (Kahn algorithm): Topological Sort | Kahn vs DFS | Grap...

Articulation points / Cut vertices:
Tarjan algorithm: Articulation Points | Cut Vertices | ...

Disjoint Set / Union Find: Disjoint Set | Union Find | Cycle Det...

Maximum Flow Problem:
Ford Fulkerson algorithm: Ford Fulkerson Algorithm | Maximum Fl...

Graph coloring / Chromatic number: Graph Coloring | Chromatic Number | B...

Hamiltonian cycle: Hamiltonian Cycle (Circuit) | Hamilto...

Euler cycle (Fleury algorithm): Euler Cycle (Circuit) | Euler Path | ...


#DataStructure,#Graphs,#FitCoder,#Algorithm,#competitiveprogramming

• #education
• #graphs
• #fit_coder
• #fitcoder
• #data_structure
• #programming
• #tutorial
• #graphs_introduction
• #graphs_explained
• #graphs_data_structures
• #graphs_c
• #graphs_implementation
• #data_structures
• #introduction_to_graphs
• #introduction_to_graphs_data_structure