import networkx as nx G = nx.DiGraph() # 有向グラフ (Directed Graph) # 頂点の追加 G.add_node(1) G.add_nodes_from([3, 4, 5]) # 辺の追加 (頂点も必要に応じて追加されます) G.add_edge(1, 2) G.add_edges_from([(1, 3), (2, 5), (3, 4), (4, 5)]) # 辺の削除 G.remove_edge(3, 4) G.remove_edges_from([(1, 3), (2, 5)]) # 頂点の削除 (削除された頂点に接続されている辺も削除されます) G.remove_node(5) G.remove_nodes_from([3, 4]) # 指定したパス上の頂点と辺を追加 nx.add_path(G, [1, 2, 3, 4, 5])
![【Python】NetworkX 2.0の基礎的な使い方まとめ - Qiita](https://cdn-ak-scissors.b.st-hatena.com/image/square/7d2ad1e1d0cfd89f0e04bd73100c68142ee16e5b/height=288;version=1;width=512/https%3A%2F%2Fqiita-user-contents.imgix.net%2Fhttps%253A%252F%252Fcdn.qiita.com%252Fassets%252Fpublic%252Farticle-ogp-background-412672c5f0600ab9a64263b751f1bc81.png%3Fixlib%3Drb-4.0.0%26w%3D1200%26mark64%3DaHR0cHM6Ly9xaWl0YS11c2VyLWNvbnRlbnRzLmltZ2l4Lm5ldC9-dGV4dD9peGxpYj1yYi00LjAuMCZ3PTk3MiZoPTM3OCZ0eHQ9JUUzJTgwJTkwUHl0aG9uJUUzJTgwJTkxTmV0d29ya1glMjAyLjAlRTMlODElQUUlRTUlOUYlQkElRTclQTQlOEUlRTclOUElODQlRTMlODElQUElRTQlQkQlQkYlRTMlODElODQlRTYlOTYlQjklRTMlODElQkUlRTMlODElQTglRTMlODIlODEmdHh0LWFsaWduPWxlZnQlMkN0b3AmdHh0LWNvbG9yPSUyMzIxMjEyMSZ0eHQtZm9udD1IaXJhZ2lubyUyMFNhbnMlMjBXNiZ0eHQtc2l6ZT01NiZzPTI0YzU5MmUxYmY2MzZjMTQ0NGRmNzc1YmFkMzVhOTJh%26mark-x%3D142%26mark-y%3D57%26blend64%3DaHR0cHM6Ly9xaWl0YS11c2VyLWNvbnRlbnRzLmltZ2l4Lm5ldC9-dGV4dD9peGxpYj1yYi00LjAuMCZoPTc2Jnc9NzcwJnR4dD0lNDBrem00MjY5JnR4dC1jb2xvcj0lMjMyMTIxMjEmdHh0LWZvbnQ9SGlyYWdpbm8lMjBTYW5zJTIwVzYmdHh0LXNpemU9MzYmdHh0LWFsaWduPWxlZnQlMkN0b3Amcz0xZDNmYWQ1MGEwNWIyMTNmZDhhZDM5NjI5NDQ0Yjk3MA%26blend-x%3D142%26blend-y%3D486%26blend-mode%3Dnormal%26s%3Dec4d757965358430b684aafc1fe99974)