by Kiel Williams

# Dijkstra

For a general graph with an arbitrary number of nodes and edges, it's usually not obvious what the shortest path is between two nodes. Dijkstra's algorithm is a famous method for systematically determining the length of that shortest path. I explore how to implement this algorithm for a simple graph in 2D, and show how it still works even if the path is subject to some simple constraints.

## Presentation Summary

In these slides, I present:

- Basic idea behind the Dijkstra algorithm

## Examples

## References

### All Graph Theory

Yubo "Paul" Yang ALGORITHM

graph theory