Graphs drawn with nodes and edges: directed, weighted, bipartite, colored, and a highlighted shortest path.


Four vertices and five edges, placed by hand: the smallest useful starting point.


Five vertices on a pentagon with directed edges, a curved pair, and a self-loop.


Distances between five towns, written on the edges.


Dijkstra's result from A to F: the path in orange and each vertex's distance beside it.


Workers and the jobs they can do, with a perfect matching drawn in green.


Course prerequisites as a directed acyclic graph, laid out in layers from left to right.


The Petersen graph colored with three colors, so no edge joins two vertices of the same color.