
Page 1 of 3
Download
Get this sheet
SubscriptionOpen any sheet in any course, up to 40 a month, keys included. Or $40 month to month.
$25/mo, billed yearly
SubscribeTry one first: a free Chapter 1 worksheet (PDF, no sign-in).
What's on the worksheet
- Grace walks between seven buildings a to g on her college campus, starting from her dorm a.
- A packet of data travels through a network of routers from router A to router F.
- Ryan ran the method from s on a weighted graph G with vertices s, a, b, c, d, e and every weight ≥ 0, but he kept only his table.
- Let G be a weighted graph with every weight positive, and let s be a vertex of G.
Teach it first
The free lesson teaches it with worked examples and practice problems.
Finding a shortest path: the lesson ›More Chapter 10 worksheets: Graphs
- 10.1Degree, the handshake lemma and complete graphs
- 10.2Walks, paths, cycles and connected graphs
- 10.3Graph isomorphism: when two drawings are the same graph
- 10.4Euler paths and circuits
- 10.5Hamiltonian paths and cycles
- 10.6Trees
- 10.7Planar graphs and Euler's formula
- 10.8Graph coloring
- 10.9Bipartite graphs
- 10.10Weighted and directed graphs
- 10.11Finding a shortest path
- 10.12Spanning trees and minimum spanning trees
- 10.13Adjacency matrices and their powers