Single-source shortest paths: Nonnegative Lengths - Professor Christian Sommer - Alogrithem - Lectures 4 of 23 - Video-lecture

Video-lecture, Algorithms

Description: The lecture is about Algorithm. In this lecture Professor Christian Sommer tells ud about Kemeny and Kurtz observe that while "undisciplined" use of unconditional GOTOs and conditional IF-THEN GOTOs can result in "spaghetti code" a programmer can write structured programs using these instructions; on the other hand "it is also possible, and not too hard, to write badly structured programs in a structured language". Lecture4 of 23
Docsity is not optimized for the browser you're using. In order to have a better experience please switch to Google Chrome, Firefox, Internet Explorer 9+ or Safari! Download Google Chrome