Sure, but a) It'd need to be called that by Dijkstra himself to be even arguably narcissistic and b) The qualifier "Dijsktra's" is important because there are

Sure, but a) It'd need to be called that by Dijkstra himself to be even arguably narcissistic and b) The qualifier "Dijsktra's" is important because there are other algorithms for finding a shortest path (Bellman-Ford, Floyd-Warshall, A*), with different trade-offs (Bellman-Ford is slower, but can handle negative weights; Floyd-Warshall gets you all pairs and may be better when the graph is dense). Accordingly, I think the grandparent's suggestion of purely descriptive names isn't feasible.