self doubt about dijkistra algorithm negative cycle

Question

Will dijkistra fail if a graph has negative weight cycle which is unreachable from source????

Answer 1

dijkstra's is a single source shortest path algorithm

if i get your question correctly unreachable vertices will not be reachable through the source only

also further, dijkstras fails for negative weight edges and so a cycle also has it failed 

the following link gives some lucid explanation on failure in the negative weight edge

https://stackoverflow.com/questions/6799172/negative-weights-using-dijkstras-algorithm/6799344#6799344--->>>>this is the right reasoning

https://stackoverflow.com/questions/13159337/why-doesnt-dijkstras-algorithm-work-for-negative-weight-edges--->>>this one is wrong