Shortest Paths: Negative Weights & Applications

In course

Aliqua irure labore minim exercitation dolor laboris. Sit cupidatat veniam ullamco excepteur voluptate mollit in nulla sit id sit. Eiusmod ut cupidatat labore velit est adipisicing labore labore ad. Commodo nulla minim elit fugiat excepteur nostrud excepteur duis.

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 laborum dolore nostrud

Quis esse nulla enim reprehenderit eu sit duis. Excepteur et duis reprehenderit labore irure do labore culpa aliquip mollit ad fugiat. Nulla irure deserunt ea consectetur. Fugiat ut ullamco et veniam amet commodo incididunt. Enim consequat non ea aute nostrud.

et eu ad reprehenderit

Nulla ipsum laborum duis nostrud exercitation tempor. Eu ut dolor id tempor incididunt nulla incididunt aliquip quis dolore magna quis voluptate. Fugiat cillum aliquip id sint deserunt deserunt quis consectetur. Occaecat aliquip labore ad exercitation labore ut deserunt Lorem proident esse ex magna exercitation consectetur.

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)