Journal ArticleDOI
Algorithm 97: Shortest path
Reads0
Chats0
TLDR
The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.Abstract:
procedure ari thmetic (a, b, c, op); in t eger a, b, c, op; ¢ o n l m e n t This procedure will perform different order ar i thmetic operations with b and c, put t ing the result in a. The order of the operation is given by op. For op = 1 addit ion is performed. For op = 2 multiplicaLion, repeated addition, is done. Beyond these the operations are non-commutat ive. For op = 3 exponentiat ion, 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 te t ra t ion, repeated exponentiat ion, is done. For op = 5, 6, 7, etc., the procedure performs pentat ion, hexation, heptat ion, etc., respectively. The routine was originally programmed in FORTRAN for the Control Data 160 desk-size computer. The original program was limited to te t ra t ion 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; b e g i n own i n t e g e r d, e, f, drop; i f o p = 1 t h e n b e g i n a := h-4c; go t o l e n d i f o p = 2 t h e n d := 0; else d := 1; e := c; drop := op 1; for f := I s t e p 1 u n t i l e do b e g i n ari thmetic (a, b, d, drop);read more
Citations
More filters
Journal ArticleDOI
On satisfiability, equivalence, and implication problems involving conjunctive queries in database systems
Sha Guo,Wei Sun,Mark Weiss +2 more
TL;DR: A novel concept of the "module closure" and a set of sound and complete axioms with respect to the " module closure" are proposed to infer all correct and necessary inequalities from a given query.
Posted Content
Community Detection in Networks using Graph Distance.
TL;DR: This work proposes an algorithm based on the graph distance of vertices in the network that works in identifying communities for block models and can be extended for degree-corrected block model and block models with the number of communities growing with number of Vertices.
Journal ArticleDOI
Network Effects in Schelling's Model of Segregation: New Evidence from Agent-Based Simulation:
TL;DR: My own simulations show that, using appropriate graph-based spatial structures, one can reveal significant spatial effects and thus provide alternative planning insights, and how a logistic model describes in a concise but precise way this global behavior at an aggregated level.
Journal ArticleDOI
A Different Approach for Solving the Shortest Path Problem Under Mixed Fuzzy Environment
TL;DR: The authors’ results show that this superior-to-superior method isﻷsuperior toﻴsolving-the- Shortest- Path Problem, and the method’s effectiveness and effectiveness are shown to be superior to previous methods.
Journal ArticleDOI
Reducing the hierarchical network design problem
C.W. Duin,A. Volgenant +1 more
TL;DR: It is shown that the HNDP is a special case of the Directed Steiner Tree Problem, and theorems are given to obtain optimal arcs, that are used in a Lagrangean relaxation of the linear programming model.