A CONSTRUCTING GRAPHS
This book has covered a range of algorithms that operate over graphs. To apply these algorithms to real-world problems, we need a mechanism for programmatically creating new graphs or loading them from files.
While the graph creation functions in Chapter 1 such as insert_node() and insert_edge() provide a full mechanism for defining graphs, it would be unrealistic to hard-code the creation of each graph. Beyond the tedium of listing out hundreds or thousands of insert_edge() statements, such an approach is error-prone.
In this appendix we introduce a variety of simple mechanisms for creating graphs and loading them ...
Get Graph Algorithms the Fun Way 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.
