Chapter 8: Storage and Feature Extraction of Graphs, Trees, and Networks
The structures we will learn about in this chapter all stem from the idea of a graph, which is a pair of sets of nodes (called vertices) and connections (called edges) linking nodes together. As we will see in this chapter and the following chapters graphs, and their variations are useful for modeling many real situations and solving practical problems in computer and data sciences.
The following topics will be covered in this chapter:
- Understanding the terminology and notation of graphs, trees, and networks
- An overview of some ways graph and network models are used in real problems
- Efficient storage of graphs of networks in Python
- Using Python to extract features of graphs ...
Get Practical Discrete Mathematics 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.
