Graph representation III - Incidence Matrix, Incidence List Explained

This is the last part of 3 part videos about Graph representation. Here I will be discussing about representation of a graph using incidence matrix and incidence list.
In Incidence matrix representation, the graph is represented using a matrix of size total number of vertices by a total number of edges. In this matrix, rows represent vertices and columns represents edges.

Source Code: https://github.com/fit-coder/fitcoder...

00:00 Introduction
00:16 Graph Representation recap
00:33 Incidence Matrix
04:30 Disadvantages
07:30 Incidence List
10:35 C++ implementation

-------------------------------------------------------------
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