Pathfinding in communication nets

1 January 1971

journal article
Published by Institution of Engineering and Technology (IET) in Proceedings of the Institution of Electrical Engineers

Vol. 118 (2) , 328-334
https://doi.org/10.1049/piee.1971.0058

Abstract

A routine is presented for determining the number and the set of all paths in oriented and in nonoriented communication nets. Duplication and the generation of nonpaths are mechanically prevented from occurring en route. The technique generalises to pathfinding in arbitrary nets.

Keywords

ORIENTED AND NONORIENTED GRAPHS
COMMUNICATION SWITCHING THEORY
PATHFINDING TECHNIQUE
COMMUNICATION NETWORKS

This publication has 3 references indexed in Scilit:

GRAPH THEORY
Published by Defense Technical Information Center (DTIC) ,1969
Connectivity in Matroids
Canadian Journal of Mathematics, 1966
Theory of Graphs
Published by American Mathematical Society (AMS) ,1962