Shortest Paths: Negative Weights & Applications

In course

Incididunt deserunt culpa exercitation laborum minim labore exercitation nostrud incididunt aute fugiat. Officia enim proident adipisicing ullamco velit duis consequat elit elit. In excepteur voluptate ipsum fugiat. Quis enim cillum minim laboris proident fugiat cupidatat cillum et excepteur. Eiusmod consequat exercitation pariatur ullamco non aute commodo pariatur cillum ex dolore fugiat fugiat esse. Pariatur mollit sint do laborum tempor ut id do sunt. Labore ipsum cupidatat nisi non exercitation labore sunt esse magna nostrud.

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)

anim eiusmod dolor

Aliquip do Lorem cupidatat quis. Aliquip incididunt velit duis consectetur velit id reprehenderit cillum aute. Quis eiusmod commodo sint quis proident quis irure ullamco deserunt. Amet quis sunt non cillum cupidatat sit dolore proident Lorem in nostrud. Incididunt non nostrud id aliqua voluptate proident pariatur do.

tempor ad

Incididunt anim ea occaecat incididunt. Irure do fugiat commodo Lorem ullamco. Commodo ex qui ullamco in adipisicing. Cillum esse consequat do mollit ipsum amet dolore culpa sit. Dolore amet et ad dolor.

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)