O'Reilly logo
  • You Wang thinks this is interesting:

A graph G = (V, E) consists of a set of nodes, V, and edges between them, E. If the edges have a direction, we say the graph is directed.


Cover of Python Algorithms: Mastering Basic Algorithms in the Python Language, Second Edition


So when thinking about graph, ask two questions: 1. what are the nodes? 2. what are the edges?