Graph is undirected. DiGraph has direction. Kenya roads in this course are undirected unless a chapter says otherwise.

Goal

Print edges for Graph vs DiGraph.

import networkx as nx
G = nx.Graph()
G.add_edge('Nairobi', 'Nakuru', km=160)
print(G.edges(data=True))
print(G.has_edge('Nakuru', 'Nairobi'))

import networkx as nx
D = nx.DiGraph()
D.add_edge('Nairobi', 'Mombasa')
print(list(D.edges()))
print(D.has_edge('Mombasa', 'Nairobi'))

import networkx as nx
print(nx.Graph([(1, 2), (2, 3)]).number_of_nodes())

import networkx as nx
G = nx.MultiGraph()
G.add_edge('Nairobi', 'Nakuru', key='road')
G.add_edge('Nairobi', 'Nakuru', key='rail')
print(G.number_of_edges())