Graph Fundamentals and Representations

Define a graph, its components (vertices, edges), and classify graphs as directed/undirected and weighted/unweighted.

Define vertex degree, in-degree, and out-degree, and apply the handshaking lemma.

Identify paths, cycles, and connected components within a graph.

Represent a graph using an adjacency matrix in C++.

Represent a graph using an adjacency list in C++.

Compare the time and space complexity trade-offs between adjacency matrix and adjacency list representations.