Summary
In this chapter, we briefly reviewed graphs and the related algorithms, starting with basic graph terminology and delved into the representation of graphs in a functional programming setting. We then implemented Dijkstra's algorithm to a Project Euler problem, and listed a few graphics libraries for modeling graphs.
In the next chapter, we are going to discuss set, map, and vectors. We will tackle a custom implementation of a vector, including several optimizations. Additionally, we will review the .NET's intermediate language and see how the code translates in a multi-language scenario. This includes F# IL generation and comparing it with C# IL to demonstrate how the intermediate language provides the very foundation of execution in the .NET Framework-based applications.
