The Hitchhiker's Guide to Graphs - Update #2
The web version is live, plus an extra chapter for insiders!
Hey!
This is a short post to inform you that the another draft version of my upcoming book, The Hitchhiker's Guide to Graphs, is already available.
If this is the first time you hear me talking about this book, read the following post:
It contains an introduction, a first chapter on the basics of graph theory, and the bulk of the second chapter on depth-first search. As always, a huge thanks to
for his feedback and collaboration on these chapters.The Hitchhiker’s Guide to Graphs is online
I’m also excited to announce that there is a public online version of the book at graphs.apiad.net.
The public version contains only the revised and mostly ready content, so you can read the introduction and the first chapter for now. Upcoming chapters will be available as drafts for early supporters as soon as we write them and will be published online for everyone once they’ve gone through full review and editing.
Get the Early Access version
If you want to read the unpublished part of the book, you can get the current and all future versions of this book today via the following link:
Inside, you will find two offers. The first one is for an early access pass, which gives you full access to all future book versions, both in PDF and EPUB formats, plus frequent updates with drafts of upcoming articles.
Also, early supporters will get access to a Discord channel where I will discuss the content of the book and get your suggestions and feedback for future content.
The second offer is a Patron pass for those who really really want to support this project. In addition to the content, you will get a special thank you note in the acknowledgment section of the final version of the book.
Premium subscribers to Mostly Harmless Ideas. check below for a discount link that gives you access to the PDF and EPUB for free.
Founding members and lifetime subscribers of Mostly Harmless are automatically considered holders of the Patron pass.
That’s it for today. See you next time :)