• ALGORITHM TO FIND TOTAL NUMBER OF PATHS IN DIRECTED ACYCLIC GRAPH
Abstract
A directed acyclic graph (DAG) is a graph with directed edges in which there are no cycles. Formally, a directed graph is a pair (N,R⊆N×N) consisting of a set of Nodes N and a binary relation R on it that specifies a directed edge from a node n to another one m whenever (n, m). IN this paper we presented on polynomial time algorithm to find total number of path in DAG.
Keywords
DAG, Path, Polynomial, Directed graph.
Full Text:
PDF
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |