This electronic book is devoted to deeper exploration of the fundamental concepts and algorithms that will undoubtedly fall into the category of ‘eternal’. Carefully reading this ebook, you get knowledge that will never become obsolete and that you’ll always enjoy.
The brevity, accuracy, adjustedness, relevance, examples and teaching assignments – are just a small list of obvious advantages of this electronic book. Illustration of algorithms in one of the best programming languages C, once again underlines their popularity and ‘eternity’.
In the ebook details the wide range of basic algorithms on graphs, including: org-graph search, neo-graph and networks, building a minimum spanning trees and shortest routes, calculate flow in networks with different characteristics. Much attention in the electronic book is given to the performance of algorithms, as well as their mathematical conclusion.
The electronic book can be used as a course of lectures (both students and teachers), a manual or just ‘novel’ while acquiring not comparable pleasure.
Entries (RSS)
is there a link?
thanks
Comment by 42 — May 11, 2009 @ 8:09 am
Excuse me, I have not found this book yet.
Comment by admin — June 7, 2009 @ 2:38 am