False. Dijkstra's algorithm is a single-source shortest path algorithm that finds the shortest path from a source vertex to all other vertices in a graph. It uses a priority queue to select the next vertex to visit and update the distances of its neighbors. Dijkstra's algorithm does not consider negative weight edges, so it is not affected by the presence of negative weight cycles in the graph. If a negative weight cycle is reachable from the source vertex, Dijkstra's algorithm will simply ignore it and continue executing as normal.
