Exploring Functional Graph Representations for Max Flow: The Abstraction of Functional Data Structure Design Techniques
dc.contributor.advisor | Wonnacott, David G. | |
dc.contributor.author | Weinstock, Harrison | |
dc.date.accessioned | 2023-12-04T17:40:56Z | |
dc.date.available | 2023-12-04T17:40:56Z | |
dc.date.issued | 2023 | |
dc.description.abstract | This paper investigates the techniques involved in the design of functional data structures and how they are realized in a functional implementation of the Ford-Fulkerson max flow method. Specifically, we focus on functional graph representations and how some of the initial issues can be handled safely without affecting user facing code. We examine the difficulty the functional paradigm presents in working with cyclic structure and how this shows up in graph traversals. We review Erwig's induction graphs and Mokhov's algebraic graphs to see two potential solutions to the same problem of handling cyclic structures in a way that allows for easy traversal. Finally, we analyze functional implementations of the max-flow algorithm to exemplify how the tools for abstraction used in the data structure design carry over to an important and common algorithm implementation. | |
dc.description.sponsorship | Haverford College. Department of Computer Science | |
dc.identifier.uri | http://hdl.handle.net/10066/50056 | |
dc.language.iso | eng | |
dc.rights.access | Open Access | |
dc.rights.uri | http://creativecommons.org/licenses/by-nc/4.0/ | |
dc.title | Exploring Functional Graph Representations for Max Flow: The Abstraction of Functional Data Structure Design Techniques | |
dc.type | Thesis |