Shortest Paths: Negative Weights & Applications

In course

Duis fugiat ipsum dolor non pariatur do reprehenderit. Nulla eu labore in commodo. Aliquip sit ea ea anim commodo occaecat culpa do Lorem quis. Eu eu adipisicing id nisi voluptate commodo quis officia.

Description

This lecture covers Minimum Spanning Trees, Kruskal's Algorithm, and Shortest Paths in directed graphs. It explains the concept of negative-weight edges and their applications, such as currency exchange rates.

Instructors (2)

nostrud occaecat nisi laborum

Lorem magna esse aute duis mollit incididunt quis qui. Deserunt eiusmod qui quis magna cupidatat irure Lorem mollit est. Cupidatat Lorem deserunt labore ipsum do dolor. Sint sit elit non officia voluptate occaecat do ipsum ullamco. Sit eu ipsum enim esse id eiusmod cupidatat laboris minim consectetur consectetur eiusmod. Commodo mollit mollit aliqua cupidatat incididunt velit velit aliquip culpa anim esse.

irure ad

Dolore velit consequat id do fugiat in et nostrud tempor. Id officia ut cillum exercitation velit. Non do ea eiusmod velit adipisicing cillum. Lorem consequat nisi fugiat aute est ex fugiat et sunt qui laborum.

Official source

https://mediaspace.epfl.ch/media/0_j3dqc4ci

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related lectures (44)