Graph can be represented by

Related MCQs

• 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
• A complete graph is a graph in which each pair of vertices is adjacent
• Graph search involves a closed list, where the major operation is a _______
• 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
• The length of the longest path in a task dependency graph is called?
• The graph of tasks (nodes) and their interactions/data exchange (edges)?