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

Some fixes

This commit is contained in:
Antti H S Laaksonen 2017-02-27 22:13:33 +02:00
parent 5182b44f31
commit 9e19e2f3a7
3 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
chapter11.tex
View File

@ -314,7 +314,7 @@ and the \key{outdegree} of a node
is the number of edges that start at the node. is the number of edges that start at the node.
For example, in the following graph, For example, in the following graph,
the indegree of node 2 is 2 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{center}
\begin{tikzpicture}[scale=0.9] \begin{tikzpicture}[scale=0.9]

4
chapter16.tex
View File

@ -658,8 +658,8 @@ achieves these properties.
\index{Floyd's algorithm} \index{Floyd's algorithm}
\key{Floyd's algorithm}\footnote{The idea of the algorithm is mentioned in \cite{knu982} \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 and attributed to R. W. Floyd; however, it is not known if Floyd actually
who discovered the algorithm.} walks forward discovered the algorithm.} walks forward
in the graph using two pointers $a$ and $b$. in the graph using two pointers $a$ and $b$.
Both pointers begin at a node $x$ that Both pointers begin at a node $x$ that
is the starting node of the graph. is the starting node of the graph.

2
chapter19.tex
View File

@ -22,7 +22,7 @@ problem and no efficient algorithm is known for solving the problem.
\index{Eulerian path} \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. when he solved the famous Königsberg bridge problem.
This was the birth of graph theory.} is a path This was the birth of graph theory.} is a path
that goes exactly once through each edge in the graph. that goes exactly once through each edge in the graph.