From 9e19e2f3a7b1ea2453517e8e78b9d1bb357864ed Mon Sep 17 00:00:00 2001 From: Antti H S Laaksonen Date: Mon, 27 Feb 2017 22:13:33 +0200 Subject: [PATCH] Some fixes --- chapter11.tex | 2 +- chapter16.tex | 4 ++-- chapter19.tex | 2 +- 3 files changed, 4 insertions(+), 4 deletions(-) diff --git a/chapter11.tex b/chapter11.tex index 110e2f4..a859926 100644 --- a/chapter11.tex +++ b/chapter11.tex @@ -314,7 +314,7 @@ and the \key{outdegree} of a node is the number of edges that start at the node. For example, in the following graph, the indegree of node 2 is 2 -and the outdegree of the node is 1. +and the outdegree of node 2 is 1. \begin{center} \begin{tikzpicture}[scale=0.9] diff --git a/chapter16.tex b/chapter16.tex index 09d99cb..941b053 100644 --- a/chapter16.tex +++ b/chapter16.tex @@ -658,8 +658,8 @@ achieves these properties. \index{Floyd's algorithm} \key{Floyd's algorithm}\footnote{The idea of the algorithm is mentioned in \cite{knu982} -and attributed to R. W. Floyd; however, it is not known if Floyd was the first -who discovered the algorithm.} walks forward +and attributed to R. W. Floyd; however, it is not known if Floyd actually +discovered the algorithm.} walks forward in the graph using two pointers $a$ and $b$. Both pointers begin at a node $x$ that is the starting node of the graph. diff --git a/chapter19.tex b/chapter19.tex index d000a7e..c941f15 100644 --- a/chapter19.tex +++ b/chapter19.tex @@ -22,7 +22,7 @@ problem and no efficient algorithm is known for solving the problem. \index{Eulerian path} -An \key{Eulerian path}\footnote{L. Euler (1707--1783) studied such paths in 1736 +An \key{Eulerian path}\footnote{L. Euler studied such paths in 1736 when he solved the famous Königsberg bridge problem. This was the birth of graph theory.} is a path that goes exactly once through each edge in the graph.