saurabh-29 / graph-theory-algorithms-book Goto Github PK

Affects: Revision 620, Page 5

I think the sentence -

"A directed graph or digraph G is a graph such that each of whose edges is 
directed."

should be re-written as

"A directed graph or digraph G is a graph such that each of its edges is 
directed."

OR

"A directed graph or digraph G is a graph each of whose edges is directed."

If you 'make' the PDF usign LiveTeX 2010, that include the 4.01 version of 
algorithm2e, you will get an 'Undefined control sequence' error. That is 
because some comands change to camel case notation (\incmargin becomes 
\IncMargin, etc)

To compile the book using that version, we need to change in 
'style/mystyle.sty' this line:

\usepackage[algochapter,linesnumbered,noend,ruled]{algorithm2e}

to:

\usepackage[algochapter,linesnumbered,noend,ruled,oldcommands]{algorithm2e}

Quotations and/or comic strips on Dijkstra's algorithm:

 1. xkcd: http://xkcd.com/342/

Version: latest-r130
Chapter 2, page 30, Algorithm 2.3: Dijkstra's Algorithm

The output line says:
Output: A shortest path from v0 to an vertex in V .

It should say:
Output: A shortest path from v0 to a vertex in V .

you might want to add the A* algo to the book on least cost path finding, 
especially i geo-scenarios, http://en.wikipedia.org/wiki/A*.

Dijkstra is a special case of A* so it should fit well ...

/peter

[deleted issue]

[deleted issue]

The definition of a graph read:  

"A graph G=(V,E) is an ordered pair of finite sets. Elements of V are called 
vertices or nodes, and elements of E\subseteq V^{(2)}are called edges or arcs." 

The reference  E\subseteq V^{(2)} was not immediately obvious to me.  Maybe 
rewriting

E\subseteq V^{(2)} 

to 

E\subseteq V\times V (where V\times V is the cross product).

As a non-mathematician, I had a hard time following what was meant by 
E\subseteq V^{(2)}.

BTW: Thank you for putting this book out under the GPL, I have wanted to learn 
more graph theory for years.  I am going through your book now.