This is an old revision of the document!
Table of Contents
Chapter 3 – Graphs
My notes on the assigned sections of Chapter 3 of Algorithm Design by Jon Kleinberg and Éva Tardos. This chapter details many elements of Graphs.
3.1 – Basic Definitions and Applications
A directed graph consists of nodes that are connected with a specific direction to their connections (edges). Generally a graph refers to an undirected graph. Some examples of graphs include transportation networks, communication networks, information networks, social networks, and dependency networks. Cycles come full circle back to their starting point. A tree is a connected graph that doesn't contain a cycle.
This section was very simplistic and I'd give it a 10/10 on readability and interestingness.
