Adjacency Matrix
Everything on SkillVeris tagged Adjacency Matrix — collected across the glossary, study notes, blog, and cheat sheets.
5 resources across 1 library
Interview Questions(5)
What is a Graph?
A graph is a data structure made of nodes (vertices) connected by edges, used to model relationships and connections such as networks, maps, or dependencies, a…
What is the Floyd-Warshall Algorithm?
Floyd-Warshall is a dynamic programming algorithm that computes the shortest path between every pair of vertices in a weighted graph in O(V^3) time by progress…
What is Prim's Algorithm?
Prim's algorithm builds a minimum spanning tree by growing a single connected tree from an arbitrary start vertex, at each step adding the cheapest edge that c…
Adjacency List vs Adjacency Matrix: When Would You Use Each?
An adjacency list stores, for each vertex, only the list of its actual neighbors, using O(V + E) space that scales with how connected the graph really is, whil…
What Are the Main Graph Representation Techniques?
The two main graph representation techniques are the adjacency list, which stores each vertex with a list of its neighbors and is space-efficient at O(V + E),…