A Generalized Matrix based Algorithm for Routing in Acyclic Unidirectional Networks

摘要：

This paper presents a generalized matrix-based algorithm for generating routing schemes in an acyclic unidirectional network The fundamental approach is to generate all possible paths from a source location to destination represented in a 2-dimensional matrix applying the proposed blanking patterns (BP) algorithm. It was found that, blanking pauerns algorithm efTectively provides the list of all routes in any unidirectional acyclic network by identifying definite patterns of combinations of rows and columns. Witb this approach, students, professionals, scientists and engineers easily implement programs for finding shortest, longest paths or to implement programs related critical path finding in project networks without understanding complex data structures or algorithms.

关键词： matrix acyclic pattern critical path

作者: Gao Yan Wen Hong Liu Laxmisha Rai

作者单位: Department of Electrical and Information Engineenng,Xuchang University, Xuchang, China Shandong Vocational College of Science and Technology, Weifang, China

会议类型: 国际会议

会议名称: 2010 2nd International Conference on Signal Processing System(2010年信号处理系统国际会议 ICSPS 2010)

会议地点: 大连

会议语种:英文

页码: 553-556

在线出版日期: 2010-07-05（万方平台首次上网日期，不代表论文的发表时间）