GRAPH ALGORITHMS

Which of the following is not single source shortest path algorithm

• Dijikstra's

  Algorithm

• Bellman-Ford

  Algorithm

• Floyd-Warshall

  Algorithm

• Bidirectional Dijkstra's algorithm

Which of the following algorithms can detect negative weight cycles in a graph?

• Dijkstra's algorithm

• Bellman-Ford algorithm

• Prim's algorithm

• Kruskal's algorithm

Which of the following algorithms can find the maximum flow in a flow network?

• Dijkstra's algorithm

• Bellman-Ford algorithm

• Ford-Fulkerson algorithm

• Prim's algorithm

Which traversal algorithm can be used to find the connected components of a graph?

• Breadth-first search

• Depth-first search

• Dijkstra's algorithm

• Prim's algorithm

What is bi-connectivity in a graph?

• When a graph is connected by two disjoint paths

• When a graph has a single cycle

• When a graph has no articulation points

The time complexity of Kruskal's algorithm

• V^2

• O(V)

• O(V^2)

• O(log V)

What is a strongly connected component in a directed graph?

• A set of vertices that are connected by a single path

• A set of vertices that are connected by a cycle

• A set of vertices that have a common neighbor

Which of the following is not a sorting algorithms?

• Bubble

• Merge

• Linear

• Insertion

Which of the following data structure used to implement DFS_______

• Stack

• Queue

• Circular Queue

• Double Ended Queue

What is the main idea behind Dijkstra's algorithm? A. B. C. D. To find the maximum flow in a network

• To find the shortest path between two vertices in an unweighted graph

• To find the shortest path between two vertices in a weighted graph with non-negative edge weights

• To find the longest path between two vertices in a weighted graph