From cdeda02aca1f1a68a0326afd4c6fbbaa54c99b06 Mon Sep 17 00:00:00 2001
From: augustin64 <me.git@augustin64.fr>
Date: Tue, 26 Dec 2023 10:48:16 +0100
Subject: [PATCH] Update graph.py

---
 aoc_utils/graph.py | 37 ++++++++++++++++++++++++++++++++++++-
 1 file changed, 36 insertions(+), 1 deletion(-)

diff --git a/aoc_utils/graph.py b/aoc_utils/graph.py
index dde22cb..f7f3df2 100644
--- a/aoc_utils/graph.py
+++ b/aoc_utils/graph.py
@@ -1,5 +1,8 @@
 from collections.abc import Mapping
 from typing import TypeVar, Optional, Iterator, Generic
+import networkx as nx
+import matplotlib.pyplot as plt
+
 
 T = TypeVar("T")
 
@@ -103,4 +106,36 @@ class Graph(Mapping, Generic[T]):
                 if distances[u] + weight < distances[v]:
                     raise ValueError("Graph contains a negative cycle")
 
-        return distances, predecessors
\ No newline at end of file
+        return distances, predecessors
+
+    def networkx(self):
+        g = nx.Graph()
+        g.add_nodes_from(self)
+        for node in self:
+            for dest, _ in self[node]:
+                g.add_edge(node, dest)
+
+        return g
+
+    def dfs(self, node, views=None):
+        if views is None:
+            views = set()
+
+        views.add(node)
+        if node in self:
+            for v, _ in self[node]:
+                if v not in views:
+                    views = views | self.dfs(v, views=views)
+        return views
+
+    def connexes(self):
+        views = set()
+
+        ccs = []
+        for node in self:
+            if node not in views:
+                cur_views = self.dfs(node)
+                ccs.append(cur_views)
+                views = views | cur_views
+
+        return ccs
\ No newline at end of file