I need help for writing a program that shows a given graph is
dag or not ?I want a complete guide about topological sorting code.
I found a code in internet but it has a lot of errors.
please help me friends.
thank you

Sorry, but as per the forum rules, no effort == no help.

Be a part of the DaniWeb community

We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.