Graph

Flashcards

1 / 4

data_structure discrete_structure combinatorial_structure nonlinear_structure directed_graph undirected_graph weighted_graph unweighted_graph labeled_graph simple_graph multigraph pseudograph hypergraph bipartite_graph complete_graph connected_graph acyclic_graph cyclic_graph planar_graph sparse_graph dense_graph dag tree adjacency_list adjacency_matrix edge_list

💬 Click on the content to Ask AI

Explore More

🔥 graph cost → Cost metrics on graphs (e.g., edge/path weights, MST total weight, cut capacity) are defined only given a graph’s vertices, edges, and representation; cost computation and optimization algorithms rely on the underlying graph structure.

🔥 directed graph → A directed_graph is a specialization of a graph where each edge has an orientation (u->v); it reuses the graph’s vertex/edge abstractions and common representations (adjacency lists/matrices) while adding direction-specific semantics and algorithms.

🌟 graph traversal →

🌟 adjacency matrix →

🌟 adjacency list →

⭐️ depth first search →

⭐️ breadth first search →

⚡️ directed acyclic graph →

⚡️ topological sort →

⚡️ minimum spanning tree →

⚡️ prim algorithm →

⚡️ shortest path →

⚡️ kruskal algorithm →

⚡️ undirected graph →

⚡️ boruvka algorithm →

⚡️ dijkstra algorithm →

⚡️ weighted graph →