Question: True or False and why? If a directed acyclic graph with n nodes has exactly one topological ordering, then it must have n(n-1)/2 edges
True or False and why?
If a directed acyclic graph with n nodes has exactly one topological ordering, then it must have n(n-1)/2 edges
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
