c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that u

this program is usefull in graph for delete a node

This program is used to generate Directed Acyclic Graph for any expression in compilers.