Take a look at a tiny given DAG and put down the number of vertices unreachable from any other vertex.
Directed acyclic graph
Unreachable vertices
Report a typo
Enter a number
___
By continuing, you agree to the JetBrains Academy Terms of Service as well as Hyperskill Terms of Service and Privacy Policy.
Create a free account to access the full topic
By continuing, you agree to the JetBrains Academy Terms of Service as well as Hyperskill Terms of Service and Privacy Policy.