Study

Focus:

⚡ Flashcards 🏆 Quiz (4) 🌁 Slideshow

Adjacency Matrix

Flashcards

1 / 3

data_structure matrix square_matrix matrix_representation graph_representation graph_theory 2d_array boolean_matrix linear_algebra binary_relation

💬 Click on the content to Ask AI

Explore More

🔥 breadth first search → BFS can be implemented over an adjacency matrix by scanning each row A[u][*] to enumerate neighbors of u and using O(1) edge-existence checks, enabling straightforward traversal on dense or small graphs (typically yielding O(n^2) time).

🔥 adjacency list → An adjacency list can be constructed by scanning each row of the adjacency matrix and collecting columns with nonzero entries (and their weights) as neighbors; understanding the matrix form ensures correct derivation and interpretation of the list and its complexity trade-offs.

⚡️ weighted graph →

⚡️ dijkstra algorithm →

⚡️ depth first search →

⚡️ floyd-warshall algorithm →