← Back to VOLUME 4, ISSUE 10, OCTOBER 2015
A polynomial time algorithm to find number of paths in directed acyclic graph between given two vertices s and t.
Abstract: The algorithm takes an input a directed acyclic graph G = (V, E) and two vertices s and t and returns the number of paths from s to t in G.
Keywords: directed acyclic graph, paths, queues.
How to Cite:
[1] Dr. Ishwar Baidari, Nagaraj Honnikoll, âA polynomial time algorithm to find number of paths in directed acyclic graph between given two vertices s and t.,â International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE), DOI: 10.17148/IJARCCE.2015.41021