Loading lesson path
DSA
Graphs focused on DSA Graphs and related concepts.
A Graph is a non-linear data structure that consists of vertices (nodes) and edges.
Before we can run algorithms on a Graph, we must first implement it somehow.
To traverse a Graph means to start in one vertex, and go along the edges to visit other vertices until all vertices, or as many as possible, have been visited.
A cycle in a Graph is a path that starts and ends at the same vertex, where no edges are repeated. It is similar to walking through a maze and ending up exactly where you started.