Fully Persistent Graphs - Which One To Choose?

  • Martin Erwig
  • Published 1997 in Implementation of Functional Languages

Abstract

Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In this paper we describe two implementations of persistent graphs and compare their running times on different graph problems. Both data structures essentially represent graphs as… (More)
DOI: 10.1007/BFb0055428

Topics

14 Figures and Tables