Graph algorithms with a functional flavour
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 308-331
- https://doi.org/10.1007/3-540-59451-5_9
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Structuring depth-first search algorithms in HaskellPublished by Association for Computing Machinery (ACM) ,1995
- Lazy functional state threadsPublished by Association for Computing Machinery (ACM) ,1994
- Comprehending monadsPublished by Association for Computing Machinery (ACM) ,1990
- A strong-connectivity algorithm and its applications in data flow analysisComputers & Mathematics with Applications, 1981
- A system which automatically improves programsActa Informatica, 1976
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972