The DOI matches its Crossref record.
Algorithm 97: Shortest path
Open accessAbstract
procedure arithmetic (a, b, c, op); integer a, b, c, op; ¢onlment This procedure will perform different order arithmetic operations with b and c, putting the result in a.The order of the operation is given by op.For op = 1 addition is performed.For op = 2 multiplicaLion, repeated addition, is done.Beyond these the operations are non-commutative.For op = 3 exponentiation, repeated multiplication, is done, raising b to the power c.Beyond these the question of grouping is important.The innermost implied parentheses are at the right.The hyper-exponent is always c.For op = 4 tetration, repeated exponentiation, is done.For op = 5, 6, 7, etc., the procedure performs pentation, hexation, heptation, etc., respectively.The routine was originally programmed in FORTRAN for the Control Data 160 desk-size computer.The original program was limited to tetration because subroutine recursiveness in Control Data 160 FORTRAN has been held down to four levels in the interests of economy.The input parameter, b, c, and op, must be positive integers, not zero; begin own integer d, e, f, drop; ifop = 1 then begina := h-4-c; go tol end ifop = 2 thend := 0; else d := 1; e := c; drop := op -1;
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
An Analysis of Several Heuristics for the Traveling Salesman Problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, II (1977) · SIAM Journal on Computing · doi:10.1137/0206041 · Cited by 837
Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
Li, G., Ding, Y., & Xie, Y. (2019) · Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems · doi:10.1145/3297858.3304023 · Cited by 594
Route Planning in Transportation Networks
Bast, H., Delling, D., Goldberg, A., Müller-Hannemann, M., Pajor, T., Sanders, P., Wagner, D., & Werneck, R. F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_2 · Cited by 610
Protein Allostery and Conformational Dynamics
Guo, J., & Zhou, H.-X. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.5b00590 · Cited by 484
Franke, L., Bakel, H. V., Fokkens, L., de Jong, E. D., Egmont-Petersen, M., & Wijmenga, C. (2006) · The American Journal of Human Genetics · doi:10.1086/504300 · Cited by 476
Antibody structure prediction using interpretable deep learning
Ruffolo, J. A., Sulam, J., & Gray, J. J. (2022) · Patterns · doi:10.1016/j.patter.2021.100406 · Cited by 216
Modeling Cyber-Physical Vulnerability of the Smart Grid With Incomplete Information
Srivastava, A., Morris, T., Ernster, T., Vellaithurai, C., Pan, S., & Adhikari, U. (2013) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2012.2232318 · Cited by 169
White, D. A., & Barber, S. B. (2012) · Journal of Archaeological Science · doi:10.1016/j.jas.2012.04.017 · Cited by 146
Trade Costs, CO2, and the Environment
Shapiro, J. S. (2016) · American Economic Journal: Economic Policy · doi:10.1257/pol.20150168 · Cited by 116
Extracting Success from IBM’s 20-Qubit Machines Using Error-Aware Compilation
Nishio, S., Pan, Y., Satoh, T., Amano, H., & Meter, R. V. (2020) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3386162 · Cited by 114
A Hardware-Aware Heuristic for the Qubit Mapping Problem in the NISQ Era
Niu, S., Suau, A., Staffelbach, G., & Todri-Sanial, A. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3026544 · Cited by 103
Learning Canonical Representations for Scene Graph to Image Generation
Herzig, R., Bar, A., Xu, H., Chechik, G., Darrell, T., & Globerson, A. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58574-7_13 · Cited by 92
Enhanced functional connectivity properties of human brains during in-situ nature experience
Chen, Z., He, Y., & Yu, Y. (2016) · PeerJ · doi:10.7717/peerj.2210 · Cited by 74
“The average clustering coefficient for a participant was then calculated 2 kC 181 as follows: 182 (3) 14 1 1 14mean ivi C C 183 The shortest path length was calculated from the shortest of all total paths from vi to vj for a pair of electrodes 184 vi and vj using the Floyd algorithm (Floyd 1962).”
MethodLu, M., Taiebat, M., Xu, M., & Hsu, S.-C. (2018) · Journal of Urban Planning and Development · doi:10.1061/(asce)up.1943-5444.0000469 · Cited by 62
Navigating the link between processing speed and network communication in the human brain
Imms, P., Domínguez D, J. F., Burmester, A., Seguin, C., Clemente, A., Dhollander, T., Wilson, P. H., Poudel, G., & Caeyenberghs, K. (2021) · Brain Structure and Function · doi:10.1007/s00429-021-02241-8 · Cited by 39
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
Cheng, C.-Y., Yang, C.-Y., Kuo, Y.-H., Wang, R.-C., Cheng, H.-C., & Huang, C.-Y. (. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3680291 · Cited by 19
HighMPNN: A Graph Neural Network Approach for Structure-Constrained Cyclic Peptide Sequence Design
Xu, W., Zhang, C., Shang, T., Mao, Q., Guo, J., & Duan, H. (2026) · IEEE Journal of Biomedical and Health Informatics · doi:10.1109/jbhi.2025.3620163 · Cited by 8
A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem
Frommer, I., & Golden, B. (2007) · Operations Research/Computer Science Interfaces Series · doi:10.1007/978-0-387-48793-9_3 · Cited by 3
Metadata
- Authors
- Floyd, R. W.
- Venue
- Communications of the ACM
- Published
- 1962-06
- Volume
- 5
- Issue
- 6
- Pages
- 345-345
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2007572995
- Cited by
- 3,998
- References
- 0
- FWCI
- 0.62
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
