Graphs

Hypercube graphs

What is a hypercube graph? 2^n bit strings, edges flip one bit. Vertices, edges, distance, the tesseract Q4, Gray codes and NetworkX code, explained.

Hypercube graphs

What is a hypercube graph? 2^n bit strings, edges flip one bit. Vertices, edges, distance, the tesseract Q4, Gray codes and NetworkX code, explained.

Directed acyclic graphs (DAGs)

What is a directed acyclic graph? One-way edges, no cycles. Examples from build tools, Airflow, git and neural nets, plus topological sort in Python.

Directed acyclic graphs (DAGs)

What is a directed acyclic graph? One-way edges, no cycles. Examples from build tools, Airflow, git and neural nets, plus topological sort in Python.

Bipartite graphs

What is a bipartite graph? Two vertex sets, edges only between them, no odd cycles. Examples, K3,3, matchings, and how to test one in NetworkX.

Bipartite graphs

What is a bipartite graph? Two vertex sets, edges only between them, no odd cycles. Examples, K3,3, matchings, and how to test one in NetworkX.

The Petersen graph

What is the Petersen graph? 10 vertices, 15 edges, girth 5, non-Hamiltonian. A labelled drawing, Python, and why it shows up in every course.

The Petersen graph

What is the Petersen graph? 10 vertices, 15 edges, girth 5, non-Hamiltonian. A labelled drawing, Python, and why it shows up in every course.