Category Archives: Data Structures and Algorithms

Interesting Graph Theory Terms

Posted on March 27, 2011 by Lex

The following is a few of the more unique graph theory terms which I have misused in the past. A giant component is a connected subgraph that contains a majority of the entire graph’s nodes The order of the graph is … Continue reading →

Posted in Data Structures and Algorithms | Tagged , , | Leave a comment

Knuth’s 912 Page Take on Part 1 of Combinatorial Algorithms

Posted on January 27, 2011 by Lex

Donald Knuth just published Volume 4A of his magnum opus The Art of Computer Programming. It’s strange to think that he needed 2000 pages to cover the very basic (or I should say “fundamental”) ideas of random numbers, sorting, and … Continue reading →

Posted in Data Structures and Algorithms | Tagged , , | Leave a comment