Assertion: algorithm | /r/CapableOf | avoid edge
Facets:
value: with larger weights
type: OTHER
Source sentences:
text: Let’s take our routing example from above, if you want to go from A to B in the shortest way possible, but you know that some roads are heavily congested, blocked, undergoing works, and so on, when using Dijkstra, the algorithm will find the shortest path while avoiding any edges with larger weights, thereby finding you the shortest route.