So there's this question.
Can Dijkstra or Bellman-Ford algorithm find all shortest path in an undirected symmetric graph?
The next version (a few minutes later, by the original poster):
Can Dijkstra algorithm find all shortest path in an undirected and symmetric graph?
Coming in at this point (not having seen the first revision), it's admittedly rather vague, but it seemed a lot like OP was wondering whether Dijkstra's algorithm can find all-pairs shortest paths in a symmetric graph.
Maybe I should've commented to make sure, but there was already a (3-hour old unanswered) comment asking for an elaboration.
After answering the presumed all-pairs shortest paths question and 2 other answers addressing an elementary Dijkstra's algorithm question, a comment indicated that OP may actually have been looking for a Hamiltonian path.
In the meantime, the question was edited (not by OP) to reflect OP's comment(s).
In my opinion, the original phrasing was too close to asking something else (which I provided what I believe to be a decent answer for), that it may have been preferred to change the question to reflect what it was close to asking and have OP ask a different better-phrased question, or have someone ask this question on OP's behalf.
What's the correct course of action here (and in general)?