bibin
/
cphb
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Fix directed Eulerian path requirement

This commit is contained in:
Laaksonen Antti H S 2018-07-03 14:58:22 +03:00
parent c8d45c39f4
commit 02e3793a43
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
chapter19.tex
View File

@ -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}