I need your help /b
(show working if possible) :)
>>707523872
pretty sure you just add the segments together starting at A, chosing the shortest path
>>707523872
I hate network communications. I don't even remember this and I took it like 4 semesters ago.
>>707523872
need figure 1 to solve the problem dumbass
>>707523872
HIJ is 13
FGH is 12
CEDF is 17
AC 8
i guess its 50
dont even remember what Dijkstra does, short unconnected paths until you find a connected path that covers the route?
>>707524940
Yep. Fucking dumbass op didn't even read the question just posted it here. Fuck you.
well i had to learn this a few month ago and i did, but now i remember nothing.
but it was really easy, i'm pretty sure there are enough tutorials on yt.
as far as i know it wasn't as annoying as RIP, cuz you didn't need to fill out the routing tables for all routers after each time they broadcast their new table...
>>707523872
they give you the algorithm on figure 1 you autistic faggot. This is dynamic programming. it's bottom up recursion. you could brute force this but then you'd be a faggog
>>707523872
Times are flawed.
Travel from C to D is longer than C to E to D among other routes as well.
