greedy-algorithms/notes.md

@@ -55,10 +55,10 @@ Problem: Given a sequence of fueling sites, the distances between consecutive si
 
 ## DAG
 
-*   Vertices (situations):
-    *   Locations
 *   Edges (actions):
     *   Ways to advance to a location up to `range` units of distance away
+*   Vertices (situations):
+    *   Locations
 *   Edge weights (optional):
     *   Distance to the next location
 *   Topological order:
@@ -209,11 +209,11 @@ Problem: Given frequencies for a set of symbols, create a lossless binary encodi
 
 ## DAG
 
-*   Vertices (situations):
-    *   …
 *   Edges (actions):
     *   …
-*   Edge weights (optional):
+*   Vertices (situations):
+    *   …
+*   Edge weights:
     *   …
 *   Topological order:
     *   …