Graph Properties / Features

2. A path in a graph is a sequence of vertices $v_1, v_2, \dots, v_n$ such that consecutive vertices are connected by edges. In a digraph, a path is denoted as $v_1 \rightarrow v_2 \rightarrow \dots \rightarrow v_n$

   $v_1 \rightarrow v_2 \rightarrow \dots \rightarrow v_n$

   .
   
   A path represents movement through the graph from one vertex to another.
   

   The sequence $1,2,3,4$ is a path because each consecutive pair of vertices is connected by an edge. Miriam Briskman, CC BY-NC 4.0.

   \documentclass[border=1pt]{standalone}
   \usepackage{tikz}
   
   \tikzset{
   vertex/.style={draw, circle, very thick, minimum size=1cm},
   edge/.style={very thick}
   }
   
   \begin{document}
   
   \begin{tikzpicture}
   
   \node[vertex] (1) at (0,0) {$1$};
   \node[vertex] (2) at (2,0) {$2$};
   \node[vertex] (3) at (4,0) {$3$};
   \node[vertex] (4) at (6,0) {$4$};
   
   \draw[edge] (1) -- (2);
   \draw[edge] (2) -- (3);
   \draw[edge] (3) -- (4);
   
   \end{tikzpicture}
   
   \end{document}