Study
Focus:
⚡ Flashcards 🏆 Quiz (3) 🌁 Slideshow

Undirected Graph

Flashcards
1 / 3
data_structure graph undirected discrete_structure graph_theory combinatorics binary_relation symmetric_relation nonlinear unordered
💬 Click on the content to Ask AI
Explore More
🔥 directed graph → Directed graphs extend undirected graphs by orienting edges, keeping the same vertex/edge framework while adding asymmetric relationships and direction-aware traversal and cycle concepts.
🔥 adjacency list → An adjacency list for an undirected graph relies on the undirected graph model: vertices and unordered edges are encoded by listing symmetric neighbors, degree equals list length, and traversals interpret connectivity without edge direction. Without the undirected-graph concepts, you cannot construct or interpret the list correctly.
🔥 adjacency matrix → An adjacency matrix encodes an undirected graph by mapping each vertex pair to 0/1, producing a symmetric VxV matrix; its dimensions and symmetry depend on the graph’s vertices and undirected edges.
🌟 breadth first search →
🌟 depth first search →
⚡️ weighted graph →
⚡️ directed acyclic graph →
⚡️ minimum spanning tree →
⚡️ dijkstra algorithm →