Exploring Functional Graph Representations for Max Flow: The Abstraction of Functional Data Structure Design Techniques

dc.contributor.advisorWonnacott, David G.
dc.contributor.authorWeinstock, Harrison
dc.date.accessioned2023-12-04T17:40:56Z
dc.date.available2023-12-04T17:40:56Z
dc.date.issued2023
dc.description.abstractThis 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.sponsorshipHaverford College. Department of Computer Science
dc.identifier.urihttp://hdl.handle.net/10066/50056
dc.language.isoeng
dc.rights.accessOpen Access
dc.rights.urihttp://creativecommons.org/licenses/by-nc/4.0/
dc.titleExploring Functional Graph Representations for Max Flow: The Abstraction of Functional Data Structure Design Techniques
dc.typeThesis
Files
Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
2023WeinstockH.pdf
Size:
190.92 KB
Format:
Adobe Portable Document Format
Description:
Thesis
Loading...
Thumbnail Image
Name:
2023WeinstockH_release.pdf
Size:
133.95 KB
Format:
Adobe Portable Document Format
Description:
** Archive Staff Only **
Collections