A bit‐pushing shortest distance algorithm
作者:
A. Rosenthal,
期刊:
Networks
(WILEY Available online 1975)
卷期:
Volume 5,
issue 4
页码: 301-305
ISSN:0028-3045
年代: 1975
DOI:10.1002/net.3230050402
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractA bit manipulation method is given for finding shortest distances from an origin in an unweighted graph, or alternatively, for finding connected components. The basic approach is similar to some component algorithms already in the literature but an easy implementation is given that overcomes the problem which prevents the others from being efficient–namely, the problem of identifying the ones in a sparse bit string without checking all the bits. The algorithm would be most effective for moderate sized graphs (about 20–100 nodes). Computational results are gi
点击下载:
PDF
(244KB)
返 回