The Stanford GraphBase
by Donald Knuth
42% recommend58% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
Mentions per year
What Hacker News says
Related books
2009–2026Literate programming
Donald Knuth
Recommended by 18 · mentioned by 9418 recommend · 94 mention18 recommend · 9418 recommend
2007–2025Beautiful Code
Andy Oram, Greg Wilson
Recommended by 48 · mentioned by 9748 recommend · 97 mention48 recommend · 9748 recommend
2008–2025Programmers at work
Susan M. Lammers
Recommended by 19 · mentioned by 3619 recommend · 36 mention19 recommend · 3619 recommend
2010–2026Physically Based Rendering
Matt Pharr, Greg Humphreys, Wenzel Jakob
Recommended by 92 · mentioned by 10992 recommend · 109 mention92 recommend · 10992 recommend
2007–2026The art of computer programming
Donald Knuth
Recommended by 336 · mentioned by 1,125336 recommend · 1,125 mention336 recommend · 1,125336 recommend
2007–2026Coders at Work
Peter Seibel
Recommended by 126 · mentioned by 233126 recommend · 233 mention126 recommend · 233126 recommend
2007–2026Algorithms
Robert Sedgewick
Recommended by 50 · mentioned by 8250 recommend · 82 mention50 recommend · 8250 recommend
2008–2026C interfaces and implementations
David R. Hanson
Recommended by 46 · mentioned by 6346 recommend · 63 mention46 recommend · 6346 recommend
…those classic Byte drawings on the cover. T is to Scheme what Scheme is to Lisp (kind of), and The T Programming Language by Jonathan Rees is the kind of book that cleanses your soul. Donald Knuth's The Stanford Graphbase contains literate programs for several elegant graph algorithms. Jim Sather's Understanding the Apple IIe is a terrific description of a computer from the bottom up, and shows you how deep knowledge…
on “My Top 100 Programming, Computer and Science Books: Part One” ↗I highly recommend the Stanford GraphBase, written by Donald Knuth. It's C code written by Knuth using the literate programming tool CWEB. If you don't know about CWEB, it's not hard to learn how to use, and probably is already installed on your…
on “Ask HN: What source code is worth studying?” ↗Look at the gb_graph module of Knuth's "Stanford GraphBase" (the Stanford GraphBase is available for download at his web-site). His explanation of his graph data structures, written in CWEB, are the clearest documentation of a complex data structure that I have…
on “Literate Programming: Retrospect and Prospects” ↗Actually, this is a list of graph database management systems. I was hoping for a list of graph databases, like Knuth's The Stanford Graphbase, which is something completely different.
on “List of graph databases” ↗Actually, this article is about 5 Graph DBMS's. If you are (like me) more interested in looking for Graph Databases to consider, it looks like Knuth's "Stanford GraphBase" is still the go-to source.
on “5 Graph Databases to Consider” ↗The Stanford GraphBase, written by Donald Knuth.
on “One Sure-Fire Way to Improve Your Coding” ↗…that is supposed to be somewhat derisive. That said, I think the tools are more usable than people give them credit. They are just slower to get started with. In particular, I've been picking up The Stanford Graphbase book recently and finding that after I have gotten used to reading more parts, the programs are getting a bit easier to understand. In ways that don't litter my mental model with tons of surface complexity.…
on “Readme-Driven Development (2010)” ↗…[2] "While I was preparing for Volume 4 of TAOCP in the 90s, I wrote several dozen short routines using what you and I know as "literate programming." Those little essays have been packaged into The Stanford GraphBase (1994), and I still enjoy using and modifying them. My favorite is the implementation of Tarjan's beautiful algorithm for strong components, which appears on pages 512–519 of that book." and "The data…
on “Ask HN: What are some interesting papers in CS for a beginner?” ↗…files is my preference. Not that I want everything in one. Having a sort of chapter concept can help give consumable chunks of a program to understand. There are several examples, but I'm finding The Stanford GraphBase to be very consumable. Even for somewhat dense c code.
on “Show HN: Anansi – a NoWeb-inspired literate programming preprocessor” ↗…programs in book form that I can. This one, is particularly dense, and big. So I have not made too much progress. :( I have made better progress in the MP3 book. Which, I have enjoyed. Same for the Stanford Graphbase. It is frustrating, as I am not a fan of c, all told. And I have not found any lisp literate programs. If you know of any, I'd be very interested.
on “Noweb – A Simple, Extensible Tool for Literate Programming” ↗https://smile.amazon.com/gp/product/1541259335 is also a great book. As is Stanford GraphBase. My personal bet is that it is probably easier to collaborate on something like this than you would think. The imposed structure of programs, in general, already makes a lot of collaboration tough.
on “Literate programming is much more than just commenting code” ↗I have tried a few blog posts with literate style code. Some in a notebook style, like https://taeric.github.io/cube-permutations-1.html. in general, that style seems easier nowadays. There is Stanford GraphBase, and a really good MP3 book that are full programs. Not to mention TeX.
on “Literate Programming: Articles” ↗…ignore the standard methodology because he had a much better one---literate programming. Knuth attributes his ability to single-handedly write huge bug-free computer programs like TeX, Metafont, the Stanford GraphBase, and the MMIX simulator to literate programming. In his FAQ, he answers the question "What is your favorite programming language?" with CWEB, the literate programming tool that is the descendent of WEB…
on “TeX Is Great, What Is TeX?” ↗It seems to me that the author may be interested in the license Donald Knuth used for the Stanford GraphBase, which looks like this: The Stanford GraphBase is copyright 1993 by Stanford University These files may be freely copied and distributed, provided that no changes whatsoever are made. All users are…
on “The arrangement with my code is the same as with my text. I create, you consume.” ↗…overhead added by many of the algorithms for scalability have a sizeable cost that has not kept pace with Moore's Law as to what can be done on a local machine. There is a similar section in Knuth's Stanford GraphBase where he examines several graph algorithms and finds that the more advanced ones have better asymptotic behavior, but that the simpler algorithms outperform them at real numbers. Bearing that I am not…
on “The Cost of Scalability in Graph Processing” ↗