# Routing: build the shortest path one step at a time

Subject: Computer Networks

Exam: TEE

Reader: https://deep-learning-study-room.vercel.app/cn/#tee/read/routing

Canonical: https://deep-learning-study-room.vercel.app/read/cn/tee/read-chapter/routing/

TEE · shared foundations and Units 3–4 · current syllabus 702AI0C023

1. [Routing, forwarding, distance and next hop](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--vocabulary/)
2. [Relaxation: replace an old route only when the candidate is cheaper](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--relaxation/)
3. [One edge relaxation · example 1](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--relax-1/)
4. [One edge relaxation · example 2](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--relax-2/)
5. [One edge relaxation · example 3](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--relax-3/)
6. [Dijkstra: settle the closest unfinished vertex](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--dijkstra/)
7. [Dijkstra · complete example 1](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--dijkstra-1/)
8. [Dijkstra · complete example 2](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--dijkstra-2/)
9. [Dijkstra · complete example 3](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--dijkstra-3/)
10. [Bellman–Ford: repeat relaxation across all edges](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--bellman/)
11. [Bellman–Ford · complete example 1](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--bellman-1/)
12. [Bellman–Ford · complete example 2](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--bellman-2/)
13. [Bellman–Ford · negative-cycle example](https://deep-learning-study-room.vercel.app/read/cn/tee/read/routing--bellman-3/)