mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-05 05:16:45 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added the method to find the isolated nodes in the graph

Browse Source
This commit is contained in:
Shivam Arora 2018-10-31 16:14:30 +05:30
parent 506172279a
commit 1a5df6bc46
1 changed files with 13 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
graphs/basic_graphs.py
View File

@ -279,3 +279,12 @@ def krusk(E_and_n):
s[j].update(s[i]) s[j].update(s[i])
s.pop(i) s.pop(i)
break break
# find the isolated node in the graph
def find_isolated_nodes(graph):
isolated = []
for node in graph:
if not graph[node]:
isolated.append(node)
return isolated