From 02e3793a4315f2ea2ad4b597d1f1b58d4bee8a98 Mon Sep 17 00:00:00 2001 From: Laaksonen Antti H S Date: Tue, 3 Jul 2018 14:58:22 +0300 Subject: [PATCH] Fix directed Eulerian path requirement --- chapter19.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/chapter19.tex b/chapter19.tex index 401a4c9..684ea08 100644 --- a/chapter19.tex +++ b/chapter19.tex @@ -160,7 +160,7 @@ In a directed graph, we focus on indegrees and outdegrees of the nodes. A directed graph contains an Eulerian path -exactly when all the edges belong to the same strongly +exactly when all the edges belong to the same connected component and \begin{itemize} \item in each node, the indegree equals the outdegree, \emph{or}