|
|
|
|
|
by estomagordo
3317 days ago
|
|
It's highly unlikely that you would be good at solving the single source shortest path problem on a weighted graph, and not be familiar with Dijkstra. And I'd say it's unheard of that you would know the first thing about the general, unit weight, problem, and not be familiar with BFS. |
|