10.0.10.0/24 10.0.11.0/24 192.168.178.0/24 R1 ╚════════════╝ R2 ╚════════════╝ R3 ╚════ R3 LAN ════╝
In OSPF each router knows the full topology, so it uses the Dijkstra algorithm to calculate the path to the destination. But in EIGRP (and any other distance vector routing protocol I believe), routers only know about routes to their neighbours. How will R1 know how to reach
192.168.178.0/24, when this is not a neighbour network?
The EIGRP and distance vector routing protocol tutorials I've studied do not seem to cover this.