DAGs
-
Which of the following graph features may NOT appear in a digraph:
-
Let \(V\) be a DAG and \(U\) be the DAG with only the covering edges of \(V\). Then,
-
compared to the length of the shortest path between two nodes in \(V\), the length of the shortest path in \(U\) between these nodes is:
-
compared to the length of the longest path between two nodes in \(V\), the length of the longest path in \(U\) between these nodes is:
-