The parent was talking about BFS, it's not exactly clear to me why you're asking about Dijkstra's. The two things are entirely different and, as the parent said, it's akin to asking bubblesort vs radix sort.
My point is that they are not entirely different; both are academic, simple, basic applications of the kind of graph theory freshmen learn. Described in terms of a heap, Djikstra is barely more complicated than BFS.
BFS is far from academic though, it's a very common tree/graph traversal algorithm when you want to traverse in-order, like propagation of events in a UI, or printing contents of a nested data structure for debugging purposes, or searching for the top-most element in a tree that meets your criteria so you can insert a new child subtree (very common operation in nested GUI). Hell, it's not even such an alien concept for a web/frontend developer...
