A collection of graph analysis APL functions

Authors:
E. Girard;D. Bastin;J. C. Rault
Affiliations:
-;-;-
Venue:
APL '72 Proceedings of the fourth international conference on APL
Year:
1972

Citing 1
Cited 1

An efficient search algorithm to find the elementary circuits of a graph

Communications of the ACM

Edge-labeled directed graphs in APL

APL '75 Proceedings of seventh international conference on APL

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set of functions dealing with graph theory is presented: graph description, modifications, k-connectivity analysis, and search for paths with given properties. Graph coding coherence and the modularity of APL functions enable one to link these different procedures at will and to use them in such different problems as digital circuit implementation, fault detection, and I. C. mask layout.