O'Reilly logo

Learning F# Functional Data Structures and Algorithms by Adnan Masood

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 9. Sets, Maps, and Vectors of Indirections

 

"All problems in computer science can be solved by another level of indirection, except of course for the problem of too many indirections."

 
 -- David Wheeler
 

"A language that doesn't affect the way you think about programming is not worth knowing."

 
 -- Alan J. Perlis

In the last chapter, we reviewed graphs and the related algorithms, starting with basic graph terminology and delved into how to represent graphs in a functional programming setting. We then used the graph data structure to implement Dijkstra's algorithm and provided a brief primer to the graphics libraries for modeling graphs.

In this chapter, we are going to review sets and maps, and will explore a custom implementation ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required