Hostname: page-component-848d4c4894-2xdlg Total loading time: 0 Render date: 2024-06-20T06:33:41.653Z Has data issue: false hasContentIssue false

Six Basics

Published online by Cambridge University Press:  21 November 2022

Carl Grafton
Affiliation:
Auburn University at Montgomery
Anne Permaloff
Affiliation:
Auburn University at Montgomery

Abstract

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Other
Copyright
Copyright © The American Political Science Association 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1 The linear programming example was taken from Executive Computing by Nevison, John (Reading: Addison-Wesley, 1981), pp. 176–78.Google Scholar It is useful for language testing purposes because it is very slow. The program we wrote runs signed digraphs with which complex systems can be modeled. (See Roberts, Fred S. and Brown, Thomas A., “Signed Digraphs and the Energy Crisis,” American Mathematical Monthly (June-July, 1975), 577–94.CrossRefGoogle Scholar) Data are entered, edited, the resulting digraph is run, and the output can be read from the screen, saved to disk, and represented in graphical form.

2 Roski, Steve, Data Structures on the IBM PC (New York: Brady, 1985).Google Scholar