Graph types

NetworkX provides data structures and methods for storing graphs.

All NetworkX graph classes allow (hashable) Python objects as nodes. Any Python object can be assigned to edges. The choice of graph class depends on the structure of the graph you want to represent.

Basic graph types

• Graph – Undirected graphs with self loops
  • Overview
  • Methods
    • Adding and Removing Nodes and Edges
    • Iterating over nodes and edges
    • Information about graph structure
    • Making copies and subgraphs
• DiGraph - Directed graphs with self loops
  • Overview
  • Methods
    • Adding and Removing Nodes and Edges
    • Iterating over nodes and edges
    • Information about graph structure
    • Making copies and subgraphs
• MultiGraph - Undirected graphs with self loops and parallel edges
  • Overview
  • Methods
    • Adding and Removing Nodes and Edges
    • Iterating over nodes and edges
    • Information about graph structure
    • Making copies and subgraphs
• MultiDiGraph - Directed graphs with self loops and parallel edges
  • Overview
  • Methods
    • Adding and Removing Nodes and Edges
    • Iterating over nodes and edges
    • Information about graph structure
    • Making copies and subgraphs

Which graph class should I use?

Graph Type	NetworkX Class
Undirected Simple	Graph
Directed Simple	DiGraph
Self loops	Graph, DiGraph
Parallel edges	MultiGraph, MultiDiGraph