8. Quick Boost with Graph | Learning F# Functional Data Structures and Algorithms

Modeling graphs using F#

A graph can be modelled in multiple ways. For instance, we can simply represent it as a collection of vertices and edges. Alternatively, it can be defined as a set of tuples containing a vertex and a set of corresponding edges. In either approach, we have to consider space-time trade-off. For example, in order to effectively represent a graph where paths can be determined quickly, we can build a data structure, which encapsulates the set of vertices and edges. However, this will result in an exponential growth of the space proportional to the square of the number of vertices.

Now, we will show one approach to model a graph in F#. The individual constructs defined here, as well as the complete code listing, can be found in the source code of the book at http://www.packtpub.com/support. In our representation, a graph consists of nodes and edges, as shown in the following code snippet:

type Graph() = 
  let mutable nodes = []
  let mutable edges = []
  member this.Nodes...

Tech Concepts

Programming languages

Tech Tools

Unlimited access to the largest independent learning library in tech of over 8,000 expert-authored tech books and videos.

Innovative learning tools, including AI book assistants, code context explainers, and text-to-speech.

50+ new titles added per month and exclusive early access to books as they are being written.

Learning F# Functional Data Structures and Algorithms

By : Adnan Masood

Learning F# Functional Data Structures and Algorithms

By: Adnan Masood

Overview of this book

Modeling graphs using F#

Learning F# Functional Data Structures and Algorithms

By : Adnan Masood

Learning F# Functional Data Structures and Algorithms

By: Adnan Masood

Overview of this book

Modeling graphs using F#

Confirmation

Buy this book with your credits?

Submit Your Feedback

Create a Free Account To Continue Reading

Sign in to activate your 7-day free access