In this unit you will: apply vertices, edges, degree, and the handshaking lemma; know adjacency matrices, adjacency lists, and properties of trees; run breadth-first search, depth-first search, and topological sorting; apply Dijkstra, Kruskal, Euler, and Hamilton; judge coloring, bipartiteness, and planarity. Practice with instant feedback, free and no sign-up needed.
Explanation and example questions