Damn Dijkstra!

Looool, wonderful inspiration

Witcher 3?

Hahahhahaha

Dijksta's algorithm is from a single source to all other vertices so in terms of girlfriends that means you'd have a bunch of side pieces and you would just hit them all up in order of who's closest lol

😂😂😂

@manbearpigcode legit analogy 😂

@PenguinRage why :( ?

@PenguinRage http://witcher.wikia.com/wiki/...

@PenguinRage BFS can give you the shortest path in a graph only if the edges are unweighted or have equal weights.

I do this with matlab neural networks, calculating the shortest path between nodes, it's called post man problem, where there is a village and the post man should deliver posts passing by houses walking systematically and not allowed to re-cross a house to times.