ACM

Communications of the ACM

Home/Magazine Archive/April 1961 (Vol. 4, No. 4)/Topological ordering of a list of randomly-numbered.../Abstract

Topological ordering of a list of randomly-numbered elements of a network

By Daniel J. Lasser
Communications of the ACM, April 1961, Vol. 4 No. 4, Pages 167-168
10.1145/355578.366314
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

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.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.