Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Completed by Xinlin Song

January 14, 2017

14 hours (approximately)

View certificate for Xinlin Song, Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming, an online non-credit course authorized by Stanford University and offered through Coursera