Dijkstra's algorithm is based on the assumption that all edge weights are non-negative. If a graph contains negative weights, Dijkstra’s algorithm may not work correctly because it doesn't handle situations where a path to a vertex becomes shorter after a vertex is already processed.
Hence, Dijkstra's algorithm fails in graphs with negative edge weights.
Digital signatures provide ________.
A Session variable is created ________.
The union and intersection of the graphs G and H are respectively 