mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-04-05 13:26:43 +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

17
graphs/basic_graphs.py
View File

@ -1,14 +1,14 @@
from __future__ import print_function from __future__ import print_function
try: try:
raw_input # Python 2 raw_input # Python 2
except NameError: except NameError:
raw_input = input # Python 3 raw_input = input # Python 3
try: try:
xrange # Python 2 xrange # Python 2
except NameError: except NameError:
xrange = range # Python 3 xrange = range # Python 3
# Accept No. of Nodes and edges # Accept No. of Nodes and edges
n, m = map(int, raw_input().split(" ")) n, m = map(int, raw_input().split(" "))
@ -141,7 +141,7 @@ from collections import deque
def topo(G, ind=None, Q=[1]): def topo(G, ind=None, Q=[1]):
if ind is None: if ind is None:
ind = [0] * (len(G) + 1) # SInce oth Index is ignored ind = [0] * (len(G) + 1) # SInce oth Index is ignored
for u in G: for u in G:
for v in G[u]: for v in G[u]:
ind[v] += 1 ind[v] += 1
@ -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