Introduction to Graphs

Graphs overview

In this module, we study two representations of graphs and basic algorithms that use these representations.

Mathematically, a (directed) graph is a pair $G = (V ,E)$ where $V$ is a set of vertices and $E$ is a set of ordered pairs of vertices called edges. An edge $(i,j)$ is directed from $i$ to $j$; $i$ is called the source of the edge and $j$ is called the target. A path in $G$ is a sequence of vertices $v_0,..., v_k$ ...