Skip to main content

Graph Search as a Feature in Imperative/Procedural Programming Languages

Abstract Graph theory is a critical component of computer science and software engineering, with algorithms concerning graph traversal and comprehension powering much of the largest problems in both industry and research. Engineers and researchers often have an accurate view of their target graph, however they struggle to implement a correct, and efficient, search over that graph.

To facilitate rapid, correct, efficient, and intuitive development of graph based solutions we propose a new programming language construct - the search statement. Given a supra-root node, a procedure which determines the children of a given parent node, and optional definitions of the fail-fast acceptance or rejection of a solution, the search statement can conduct a sea... (more)
Created Date 2018
Contributor Henderson, Christopher (Author) / Bansal, Ajay (Advisor) / Lindquist, Timothy (Committee member) / Acuna, Ruben (Committee member) / Arizona State University (Publisher)
Subject Computer science / Computer engineering / Backtracking / Declarative Programming / Golang / Graph Search / Imperative Programming / Programming Languages
Type Masters Thesis
Extent 93 pages
Language English
Reuse Permissions All Rights Reserved
Note Masters Thesis Software Engineering 2018
Collaborating Institutions Graduate College / ASU Library
Additional Formats MODS / OAI Dublin Core / RIS

  Full Text
1.3 MB application/pdf
Download Count: 24

Description Dissertation/Thesis