Not a type of graph traversal algorithm: Prims algorithm

Explanation:
Prims algorithm is not a type of graph traversal algorithm. It is actually a minimum spanning tree algorithm used to find the minimum weight spanning tree in a connected weighted graph.

Graph traversal algorithms are used to visit or explore all the vertices or nodes of a graph. They are used to solve various problems related to graphs, such as finding a path between two nodes, determining connectivity, or searching for a particular node.

Here are the details of the three given graph traversal algorithms and their purposes:

1. Breadth-First Search (BFS):
- BFS is a graph traversal algorithm that starts at a given source node and explores all the vertices of the graph in breadth-first order.
- It uses a queue data structure to keep track of the vertices to be visited.
- BFS is often used to find the shortest path between two nodes in an unweighted graph.

2. Depth-First Search (DFS):
- DFS is a graph traversal algorithm that starts at a given source node and explores as far as possible along each branch before backtracking.
- It uses a stack data structure to keep track of the vertices to be visited.
- DFS is often used to detect cycles in a graph, to generate a topological sorting of a directed acyclic graph, or to solve maze problems.

3. Dijkstra's algorithm:
- Dijkstra's algorithm is not a graph traversal algorithm but a shortest path algorithm.
- It is used to find the shortest path between a source node and all other nodes in a weighted graph with non-negative edge weights.
- Dijkstra's algorithm uses a priority queue to select the next vertex with the smallest distance from the source.

In summary, Prims algorithm is not a graph traversal algorithm, but a minimum spanning tree algorithm. The correct answer is option 'D'.