Operations Research 08E: Minimum Spanning Tree

[@YongWang]

Hi Guys, please comment and let me know what you think about this Operations Research Open Course. Your feedback is really appreciated. If you enjoy the video, please subscribe and share. All my replies here are only related to the content in my own videos. I am afraid I won't be able to answer other questions. Thanks for your understanding.

[@irwinbudianto2947]

感谢！！我们运筹学的法国教授真的每天都在用你的视频来帮助讲解！太实用了 ！非常明确。

[@farmcat3198]

I really appreciate that you put this course together and uploaded the videos. Thank you!

[@arwaalshikrian5354]

thank you for these efforts its very clear an organized , helps me a lot.

[@fulgent6875]

In the third example，C&G should be connected at 2:10.

[@nooni213]

Thanks mr. Wang

[@irwinbudianto2947]

i love you yong wang

[@tahmeenakhan7248]

Thank you. Please confirm is this Prim's algorithm

[@mehmetaltn277]

You r the man

[@YongWang]

thanks, mehmet

[@siddhartharaja9413]

Sir,how to do when graph is directed?

[@mostinho7]

Done, but shows prim's algorithm (starting from a node) instead of kruskal's (starting from an edge)

[@YongWang]

Good point, mostafa. For those who are interested, an interesting discussion on the Prim's vs Kruskal's algorithms are here stackoverflow.com/questions/1195872/when-should-i-use-kruskal-as-opposed-to-prim-and-vice-versa

[@Oreo_Overdose]

Thanks, sir.

[@mehwishkhan9307]

Thankyou