• A A graph in which every node is connected to every other node
  • B A graph in which every edge has a direction associated with it
  • C A graph in which the nodes can be divided into two sets such that every edge connects a node in one set to a node in the other set
  • D A graph in which every node has at most one incoming edge
  • Share this MCQ
‹ Previous Next ›
Write your comment