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.
Let \( G \) be a simple, unweighted, and undirected graph. A subset of the vertices and edges of \( G \) are shown below.
It is given that \( a - b - c - d \) is a shortest path between \( a \) and \( d \); \( e - f - g - h \) is a shortest path between \( e \) and \( h \); \( a - f - c - h \) is a shortest path between \( a \) and \( h \). Which of the following is/are NOT the edges of \( G \)?
Let a random variable \( X \) follow Poisson distribution such that \( P(X = 0) = 2P(X = 1) \). Then, P(X = 3) = ______
The probability distribution of a random variable \( X \) is given as follows. Then, \( P(X = 50) - \frac{P(X \leq 30)}{P(X \geq 20)} \) =