From bafe69838c90e82825e5465e7a9e336601b3c231 Mon Sep 17 00:00:00 2001
From: Rishikesh Jagadale <87235655+rissh@users.noreply.github.com>
Date: Thu, 18 May 2023 23:59:44 +0530
Subject: [PATCH] Create Minimum Number of Vertices to Reach All Nodes.py

---
 ...imum Number of Vertices to Reach All Nodes.py | 16 ++++++++++++++++
 1 file changed, 16 insertions(+)
 create mode 100644 May_Leetcode_Challenge/Day18/Minimum Number of Vertices to Reach All Nodes.py

diff --git a/May_Leetcode_Challenge/Day18/Minimum Number of Vertices to Reach All Nodes.py b/May_Leetcode_Challenge/Day18/Minimum Number of Vertices to Reach All Nodes.py
new file mode 100644
index 0000000..19f94a0
--- /dev/null
+++ b/May_Leetcode_Challenge/Day18/Minimum Number of Vertices to Reach All Nodes.py	
@@ -0,0 +1,16 @@
+
+class Solution:
+    def findSmallestSetOfVertices(self, n: int, edges: List[List[int]]) -> List[int]:
+
+        income = collections.defaultdict(list)
+
+        for src,dst in edges:
+            income[dst].append(src)
+
+        res = []
+        for i in range(n):
+            if not income[i]:
+                res.append(i)
+
+        return res
+