I've asked a question, under this link: Will Dijkstra's algorithm work when there are more than 1 direct connections in an undirected graph .
It has been closed (even though I've been up-voted 5 times and the question has been verified by a 12k rep stackoverflow member). Reason of closing my question is that it is a duplicate, but it isnt. There's a very similar question but it has not been solved and it has been asked like 3 years ago.
Here's the comments from my question:
It is an exact duplicate, but the original question has no solution - only a statement that a solutions exist elsewhere (and that 815 people at SPOJ have found one). – lserni Jan 6 at 18:30
It is not an exact duplicate -- the other question makes no mention at all of even the possibility that there could be two or more paths between a pair of nodes, nor the extra condition attached to hem.
Could I get my question reopened somehow? I want to set it for a bounty with a hope of getting answered. I've been waiting for that and out of nowhere, It got closed.