Adjacency Matrix by Dr. D Sree Lakshmi

Adjacency Matrix by Dr. D Sree Lakshmi | IARE

#AdjacencyMatrix #GraphTheory #DataStructures #ComputerScience #DiscreteMathematics #GraphRepresentation

An Adjacency Matrix is a square matrix used to represent a graph in computer science and mathematics. Each element A[i][j] in the matrix indicates whether there is an edge from vertex i to vertex j.

For undirected graphs, the matrix is symmetric.

For directed graphs (digraphs), the direction matters: A[i][j] = 1 means an edge from i to j.

For weighted graphs, the matrix stores the weight instead of just 1

Adjacency matrix, graph representation, directed graph, undirected graph, weighted graph, matrix representation of graphs, graph algorithms, data structures, graph theory basics



Website Link :- https://www.iare.ac.in/
Akanksha Link :- https://akanksha.iare.ac.in/
YouTubeLink :-    / @iarehyderabad  
Facebook Link :-   / iareofficial  
Instagram Link :-   / iare_hyderabad  
Flickr Link :- flickr.com/photos/186282793@N05/albums

#marrirajasekharreddy
Instagram Link :-   / marrirajasekar  
Facebook Link :-   / trsrajasekhar  
Twitter :- https://x.com/marrirajasekar
LinkedIn :-   / marri-rajasekhar-reddy-69a06844  

Institute of Aeronautical Engineering
Dundigal, Hyderabad – 500 043,
Telangana, India.
Phone:8886234501, 8886234502,
040-29705852, 29705853, 29705854
Email: [email protected],
[email protected]

Adjacency matrix, graph representation, directed graph, undirected graph, weighted graph, matrix representation of graphs, graph algorithms, data structures, graph theory basics