Data Structure › Graph › Question #5663
MCQ Single Best Answer Easy

QWhat is the difference between a directed and an undirected graph?

ID: #5663 Graph 283 views
Question Info
#5663Q ID
EasyDifficulty
GraphTopic
Start Quiz on This Topic
 Your Answer

Choose the Best Option

Click any option to instantly check if you're correct.

  • A A directed graph has edges with directions, while an undirected graph does not. ✔ ✖
  • B A directed graph has cycles, while an undirected graph does not. ✔ ✖
  • C A directed graph has only one connected component, while an undirected graph can have multiple connected components. ✔ ✖
  • D A directed graph has only one source node, while an undirected graph can have multiple source nodes. ✔ ✖
Correct Answer: Option A

Explanation

A directed graph has edges with directions, while an undirected graph does not. In a directed graph, each edge has a direction associated with it, indicating that the edge only goes from one node to another. In an undirected graph, edges do not have directions, indicating that the edge goes both ways between two nodes.
 Continue Practice
Previous Question No Next
 Share

Share This Question

Challenge a friend or share with your study group.

 More from This Topic

Related MCQ Questions

What is a bipartite graph? What is the time complexity of Breadth First Search (BFS) on a graph with V vertices and E edges? What is a graph? What is the Kruskal's algorithm used for in graph theory? What is a path in a graph? What is a vertex in a graph? What is Dijkstra's algorithm used for in graph theory? What is a weighted graph? What is the Floyd-Warshall algorithm used for in graph theory? What is an undirected graph?