Skip to main content

Search

Show all results for

Home

Lecture

Physarum can compute shortest paths

About
Privacy
Disclaimer

Copyright © 2025 EPFL, all rights reserved

Graph Chatbot

Description

This lecture explores how Physarum Polycephalum, a slime mold, can compute shortest paths in a directed graph model. It delves into the unit flow routing in the graph, equilibrium points, and Lyapunov functions.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

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

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.

In course

DEMO: nostrud exercitation ad eiusmod

Nisi dolore consequat aliqua exercitation sunt nisi Lorem voluptate in et culpa incididunt voluptate. Commodo fugiat labore ad eiusmod eu elit proident velit pariatur est sit aute. Nulla nisi cillum cillum do irure ipsum labore est occaecat anim qui eu fugiat. Nulla magna incididunt commodo eu labore ea pariatur. Laborum incididunt consectetur voluptate sit velit dolore magna aute velit incididunt nulla culpa laboris ullamco. Dolor anim aliquip proident ullamco nostrud aliquip. Excepteur duis ipsum officia dolore id laborum qui dolor deserunt deserunt occaecat qui minim laborum.

Instructor

et laboris ullamco

Occaecat mollit eu deserunt ea irure eu quis ex fugiat nostrud ex veniam nostrud. Et amet ullamco laborum voluptate velit ut est. Occaecat nostrud sit quis aliqua tempor consequat. Voluptate minim sit in eiusmod incididunt velit pariatur nisi. Do elit mollit non cupidatat ullamco. Aliqua fugiat irure aliquip in elit proident nulla pariatur. Ad sint ex qui est id proident velit aute in mollit proident qui veniam.

Related lectures (29)

Graph Algorithms: Modeling and Traversal

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Fixed Points in Graph Theory

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Graph Algorithms: Basics

Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.

Solving Parity Games in Practice

Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.

Graph Theory and Network Flows

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.