Book Image

Network Science with Python and NetworkX Quick Start Guide

By : Edward L. Platt
Book Image

Network Science with Python and NetworkX Quick Start Guide

By: Edward L. Platt

Overview of this book

NetworkX is a leading free and open source package used for network science with the Python programming language. NetworkX can track properties of individuals and relationships, find communities, analyze resilience, detect key network locations, and perform a wide range of important tasks. With the recent release of version 2, NetworkX has been updated to be more powerful and easy to use. If you’re a data scientist, engineer, or computational social scientist, this book will guide you in using the Python programming language to gain insights into real-world networks. Starting with the fundamentals, you’ll be introduced to the core concepts of network science, along with examples that use real-world data and Python code. This book will introduce you to theoretical concepts such as scale-free and small-world networks, centrality measures, and agent-based modeling. You’ll also be able to look for scale-free networks in real data and visualize a network using circular, directed, and shell layouts. By the end of this book, you’ll be able to choose appropriate network representations, use NetworkX to build and characterize networks, and uncover insights while working with real-world systems.
Table of Contents (15 chapters)

MultiGraph and MultiDiGraph – parallel edges

Meanwhile, in 18th-century Königsberg, both Graph and DiGraph fall short. Several of the bridges of Königsberg (discussed in Chapter 1, What is a Network?) connected the same two landmasses. In order to represent the bridges as a network, the nodes representing the land masses need to have multiple parallel edges, but the Graph class only allows one edge between a pair of nodes. For situations like this, NetworkX provides the MultiGraph and MultiDiGraph classes. For many applications, parallel edges can be combined into a single weighted edge, but when they can't, these classes can be used.

These MultiGraph and MultiDigraph classes work very much like Graph and DiGraph, but allow parallel edges. Any number of edges can be added between the same two endpoints. The following example reconstructs the Königsberg...