Algorithm 97: Shortest path

Algorithm 97: Shortest path H. J. ALGORITItM 93 mainb0dy: WEGSTE N, Editor GENERAL ORDER ARITHMETIC MILLARD H . PERSTEIN C o n t r o l D a t a C o r p . , P a l o A l t o , Calif. initiate: exit: p r o c e d u r e arithmetic (a, b, c, op); i n t e g e r a, b, c, op; ¢ o n l m e n t This procedure will perform different order arithmetic operations with b and c, p u t t i n g 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 i m p o r t a n t . The innermost implied parentheses are at the right. The h y p e r - e x p o n e n t is always c. For op = 4 t e t r a http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Algorithm 97: Shortest path

Communications of the ACM, Volume 5 (6) – Jun 1, 1962

Loading next page...
 
/lp/association-for-computing-machinery/algorithm-97-shortest-path-vfUV15kIQc
Publisher
Association for Computing Machinery
Copyright
Copyright © 1962 by ACM Inc.
ISSN
0001-0782
D.O.I.
10.1145/367766.368168
Publisher site
See Article on Publisher Site

Abstract

H. J. ALGORITItM 93 mainb0dy: WEGSTE N, Editor GENERAL ORDER ARITHMETIC MILLARD H . PERSTEIN C o n t r o l D a t a C o r p . , P a l o A l t o , Calif. initiate: exit: p r o c e d u r e arithmetic (a, b, c, op); i n t e g e r a, b, c, op; ¢ o n l m e n t This procedure will perform different order arithmetic operations with b and c, p u t t i n g 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 i m p o r t a n t . The innermost implied parentheses are at the right. The h y p e r - e x p o n e n t is always c. For op = 4 t e t r a

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Jun 1, 1962

There are no references for this article.

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off