Link-state: each router floods its own link costs, then runs Dijkstra over the whole map.
Distance-vector: routers tell their neighbours only the best distance they know.
After a link fails, distance-vector converges slowly: count-to-infinity.
ClozeSlide 7
Distance-vector converges slowly because of count-to-infinity.
BasicSlide 7
What does a link-state router flood to the network?
Press the card to turn it over.
Roadmap to your Anki deck
Science-based card writing: every slide is read closely, key facts are extracted and
one at a time become a flashcard built for active recall. One fact, one clear question.
1
Upload the slides
Add slides to projects per course. Slides are extracted and processed all at once.
2
Draft the cards
Our AI model goes through the slides and creates flashcards based on science.
3
Sweep through like on Tinder
One card at a time, evaluate value and keep or sweep – just like your favorite dating app.
4
Export to Anki
Download an .apkg file. Can be repeated unlimited times.
Slides on the left, cards on the right
Our split view makes it easy to see both the card and the information it came from.
Change the slide and the card list follows.
Networks: Lecture 04Slide 7 of 4118 cards
Slide 73 cards
Link-state vs distance-vector
Each router floods its own link costs, then runs Dijkstra over the whole map.
Slide 82 cards
Count-to-infinity
Split horizon, poisoned reverse, and why neither is a cure.
Slide 9No cards yet
Path vector: BGP
Each advertisement carries the whole AS path, so a loop is visible.
Basic
What does a router flood to the network in link-state routing?
The cost of the links directly attached to it.
Cloze
Distance-vector converges slowly because of {{c1::count-to-infinity}}.
Reversedanswer restates the question
Dijkstra's algorithm
Basic
Why does split horizon not fix count-to-infinity in every topology?
It only suppresses the two-router loop; a loop of three or more still counts up.
Cloze, maths and image occlusion
All your favorite Anki features are already considered during card generation.
Just the figure, not the whole slide
Pictures, charts or tables related to slides are cropped out of the page, so a card about one diagram doesn't carry the rest of the lecture with it.
Duplicates and mistakes, flagged
Find the same fact asked on slide 7 and again on slide 19. Get told when cards are incomplete.
Keyboard the whole way
Next card, new card, edit, cloze, save. Shortcut-based for maximum productivity.
jkneo?
Thirty new cards, one decision at a time
Avoid cognitive overload. Sweep through newly generated cards to remove the unwanted.
Slide 7Link-state vs distance-vector
Each router floods its own link costs, then runs Dijkstra over the
whole map. Distance-vector routers pass on only the best distance
they know.
Basic1 of 3
What does a router flood to the network in link-state routing?
The cost of the links directly attached to it.
Cloze2 of 3
A link-state router runs Dijkstra's algorithm over its topology database.
Basic3 of 3
Routing
The process of routing in a network.
Queue clear.
Pick your model, see the price first
We support Gemini, Claude, GPT, whichever you prefer. We estimate the costs before generating them for you.
≈ 0.11 EUR19 slides in 5 requests, about 33 cards
What lands in Anki
Four note types: Basic, Basic and reversed, Cloze, and image occlusion.
The source slide on the back, folded away until you ask for it.
Images inside the package, so the cards work offline.
Stable notes: the second export updates what the first one made.
A sub-deck per lecture, under one deck for the course.
Start with one lecture
Upload a PDF, draft its cards, sweep them, export. Your first deck is
just a few clicks away.
We use Google Analytics to see which pages are used, which sets cookies
and sends usage data to Google. You can turn it off here or under
Cookie settings at any time.
Details