Modify the recursive DFS approach so that it computes a topological sort if the graph is a directed acyclic graph, and reports an error if the graph has a directed cycle. Your pseudo-code may use an exit function which takes in a string parameter, print it as an error, and then quits the program.
Need pseudo-code only.
Bu iş için 5 freelancer ortalamada $18 teklif veriyor
hey hope you are fine and doing great.i have seen details and can do [login to view URL] for job to be [login to view URL] you