A compact hash function for paths in PERT networks |
| |
Authors: | Vidyadhar G. Kulkarni |
| |
Affiliation: | University of North Carolina at Chapel Hill, NC 27514, USA |
| |
Abstract: | This paper presents a method of identifying all directed paths from the source to the sink (called ‘paths’ in this paper) in a directed acyclic network with one source and one sink. Let L be the set of all the paths in this network and N = |L|. A hash function H:L → {0, 1, …, N ? 1} is constructed having the following properties: it is one-to-one and onto, the algorithms to compute H and its inverse are linea in the number of arcs in the network, it has the smallest possible range and produces no collisions. All these properties make it a very useful hash function in writing computer programs which involve storing information about all paths in the network. The techniques described in this paper can be used to construct hash functions for walks in cyclic graphs. An application to simulation of stochastic networks is described and an illustrative example is included. |
| |
Keywords: | directed acyclic networks path enumeration hash function |
本文献已被 ScienceDirect 等数据库收录! |
|