Adjacency Matrix in Graph Data Structure | Graph Implementation

preview_player
Показать описание
Adjacency Matrix -
An adjacency matrix is a way of representing a graph as a matrix of booleans (0's and 1's).
A finite graph can be represented in the form of a square matrix on a computer, where the boolean value of the matrix indicates if there is a direct path between two vertices.
Let's assume the n x n matrix as adj[n][n].
if there is an edge from vertex i to j, mark adj[i][j] as 1. i.e. adj[i][j] == 1
if there is no edge from vertex i to j, mark adj[i][j] as 0. i.e. adj[i][j] == 0
---------------------------------------------------------------------------------------------
Graph Theory -
Graph Full C++ Code Implementation -
---------------------------------------------------------------------------------------------
Support Simple Snippets by Donations -
---------------------------------------------------------------------------------------------
Timecodes -
00:00 Introduction & Recap
00:40 Adjacency Matrix Definition
03:03 Working of Adjacency Matrix
08:39 Time & Space Complexity of Adjacency Matrix
---------------------------------------------------------------------------------------------
Simple Snippets Official Website -
Simple Snippets on Facebook -
Simple Snippets on Instagram -
Simple Snippets on Twitter -
Simple Snippets Google Plus Page -
Simple Snippets email ID -

#graphs #graphds #datastructures
Рекомендации по теме
Комментарии
Автор

I'm not at graphs yet but I'm 100% sure that you explained it in an excellent way so gave a thumbsup already!

whatdoiputhere
Автор

Bro I am from NIT SURATHKAL
And your explanation is on next level
The intrest you maintain during the theory, is outstanding 👏
Nice bro👍

deepakbasoiya
Автор

Sir please make videos on, hashing, hash table, hashmap, chaining, open addressing, priority queue using link list and array, spaning tree, Dijkstra algorithm, minimum cost spaning tree and cover all topics of graph as soon as possible thanks.

iqrabashir
Автор

I had my DS paper yesterday and this was the only topic that I did not study from your channel😂

conormcgregor
Автор

lots of respect and prays from Pakistan.

Qaiser-xs
Автор

Thank you for your efforts, I hope you complete the graph and explain dijkstra's algorithm

georgemagdy
Автор

More thumbs up needed, lets motivate the guy.

yamilz
Автор

I love your playlist on c++ ...can you please create a playlist on OS (operating system)

snsbdccRJccb-ykyw
Автор

Real hero.. Bhaiya which course should I choose of nptel.. Can i go with design and analysis of algorithm..?

prateekjain
Автор

bro plz solve hacker rank c++ questions

kalpakpatil
Автор

By when all the topics will be completed? Will it be done within a month?

shouryaprasad
Автор

Please try to complete graph as soon as possible 🙏🏻

abhimannyumagar
Автор

quiet confusing 😅the list/hastable part....rest is all good

rohantyagi