diff --git a/dynamic-programming/notes.md b/dynamic-programming/notes.md
index cb7f3fe58cfd92364bf304299c7a995d94ed5634..857c51c3274b3e86dd398e15d5c649404fe93ad3 100644
--- a/dynamic-programming/notes.md
+++ b/dynamic-programming/notes.md
@@ -82,8 +82,8 @@ Problem: Subject to an integer weight limit, what choice of items (allowing repe
* Item A weighs 3 kg and is worth $10.
* Item B weighs 4 kg and is worth $14.
- Backpointer
- -------------------
+ Vertex Backpointer Notes for Humans
+ ----------- ------------------- ----------------
Weight (kg) Item Total Value (Back to Weight)
----------- ------ ----------- ----------------
0 [none] $0 ⊥
@@ -141,17 +141,17 @@ Problem: Wrap a paragraph to a line length, minimizing the sum of the squares of
> x x x x xxxx xxxx
> 0 1 2 3 4 5 6
- Backpointer
- -----------------------------
- Index Previous Index Total Penalty
- ----- -------------- -------------
- 0 ⊥ 0
- 1 … …
- 2 … …
- 3 … …
- 4 … …
- 5 … …
- 6 … …
+ Vertex Backpointer
+ ------ -----------------------------
+ Index Previous Index Total Penalty
+ ------ -------------- -------------
+ 0 ⊥ 0
+ 1 … …
+ 2 … …
+ 3 … …
+ 4 … …
+ 5 … …
+ 6 … …
Reversed Path
----