McqMate

Q. |
## Graph search involves a closed list, where the major operation is a _______ |

A. | sorting |

B. | searching |

C. | lookup |

D. | none of above |

Answer» C. lookup |

618

0

Do you find this helpful?

8

View all MCQs in

High Performance Computing (HPC)No comments yet

- A complete graph is a graph in which each pair of vertices is adjacent
- A decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges indicating that the result of one task is required for processing the next. Such graph is called as
- The critical issue in parallel depth-first search algorithms is the distribution of the search space among the processors.
- Best-first search (BFS) algorithms can search both graphs and trees.
- Task dependency graph is ------------------
- In task dependency graph longest directed path between any pair of start and finish node is called as --------------
- Topological sort of a Directed Acyclic graph is?
- When the topological sort of a graph is unique?
- The space required to store the adjacency matrix of a graph with n vertices is
- Graph can be represented by