Computer scienceAlgorithms and Data StructuresData structuresGraphsGraph types

Directed acyclic graph

Properties of real DAGs

Report a typo

All of the below statements are false if you consider just directed graphs. However, if you turn to directed acyclic graphs, two of them become true, while the other one remains false. Find this one false statement.

Select one option from the list

The graph contains no cycles

The graph has topological ordering

If you make all edges undirected, then the resulting graph will contain no cycles

___

Create a free account to access the full topic