princeton algorithm part I&II

notes

about min-cut: don't imagine it as a spatial sepration. essentially, it's a boundary where you find out that you have no augmenting path.

Name		Name	Last commit message	Last commit date
Latest commit History 29 Commits
baseball_elimination/src		baseball_elimination/src
boggle/src		boggle/src
burrows_wheeler_data_compression/src		burrows_wheeler_data_compression/src
collinear_points/src		collinear_points/src
eight_puzzle/src		eight_puzzle/src
kd_trees/src		kd_trees/src
percolation/src		percolation/src
randomized_queues_deques/src		randomized_queues_deques/src
seam_carving/src		seam_carving/src
word_net/src		word_net/src
README.md		README.md

Provide feedback