filmov
tv
Adjacency Matrix in Graph Data Structure | Graph Implementation
![preview_player](https://i.ytimg.com/vi/lUF83PciW4s/maxresdefault.jpg)
Показать описание
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
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
Комментарии