Topic: Graph Theory Problem / Level: beginner

Problem: Write a program to find all vertices with no incoming edges in a directed acyclic graph.

Run the code to see the output here...