Hostname: page-component-745bb68f8f-s22k5 Total loading time: 0 Render date: 2025-01-12T04:25:50.372Z Has data issue: false hasContentIssue false
  • English
  • Français

Inductive graphs and functional graph algorithms

Published online by Cambridge University Press:  29 August 2001

MARTIN ERWIG
MARTIN ERWIG
Affiliation:
Department of Computer Science, Oregon State University, Corvallis, Oregon 97331, USA (e-mail: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We propose a new style of writing graph algorithms in functional languages which is based on an alternative view of graphs as inductively defined data types. We show how this graph model can be implemented efficiently, and then we demonstrate how graph algorithms can be succinctly given by recursive function definitions based on the inductive graph view. We also regard this as a contribution to the teaching of algorithms and data structures in functional languages since we can use the functional-style graph algorithms instead of the imperative algorithms that are dominant today.

Type
Research Article
Information
Journal of Functional Programming , Volume 11 , Issue 5 , September 2001 , pp. 467 - 492
Copyright
© 2001 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.