Topological ordering of a list of randomly-numbered elements of a network
- 1 April 1961
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 4 (4) , 167-168
- https://doi.org/10.1145/355578.366314
Abstract
A network of directed line segments free of circular elements is assumed. The lines are identified by their terminal nodes and the nodes are assumed to be numbered by a non-topological system. Given a list of these lines in numeric order, a simple technique can be used to create at high speed a list in topological order.Keywords
This publication has 0 references indexed in Scilit: