© Vsevolod Domkin 2021
V. DomkinProgramming Algorithms in Lisphttps://doi.org/10.1007/978-1-4842-6428-7_10

10. Graphs

Vsevolod Domkin1  
(1)
Kyiv, Ukraine
 
../images/502489_1_En_10_Chapter/502489_1_En_10_Figa_HTML.png

Graphs have already been mentioned several times in the book, in quite diverse contexts. Actually, if you are familiar with graphs, you can spot opportunities to use them in quite different areas for problems that aren’t explicitly formulated with graphs in mind. So, in this chapter, we’ll discuss how to handle graphs to develop such intuition to some degree.

But first, let’s list the most prominent examples of the direct graph applications, some of which we’ll see here in action:
  • Pathfinding

  • Network ...

Get Programming Algorithms in Lisp: Writing Efficient Programs with Examples in ANSI Common Lisp 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.