Chapter 6. Graph Fundamentals
In this chapter, we will cover the following recipes:
- Representing a graph from a list of edges
- Representing a graph from an adjacency list
- Conducting a topological sort on a graph
- Traversing a graph depth-first
- Traversing a graph breadth-first
- Visualizing a graph using Graphviz
- Using Directed Acyclic Word Graphs
- Working with hexagonal and square grid networks
- Finding maximal cliques in a graph
- Determining whether any two graphs are isomorphic
Introduction
This section on graphs is a natural extension to the previous one about trees. Graphs are an essential data structure for representing networks, and this chapter will cover some ...
Get Haskell Data Analysis Cookbook now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
