#NEWLINE# def atlas6( ) : #NEWLINE# #INDENT# ' Return the atlas of all connected graphs of 6 nodes or less.\n        Attempt to check for isomorphisms and remove.\n    ' #NEWLINE# Atlas = graph_atlas_g ( ) [ 0 : 208 ] #NEWLINE# U = nx . Graph ( ) #NEWLINE# for G in Atlas : #NEWLINE# #INDENT# zerodegree = [ n for n in G if ( G . degree ( n ) == 0 ) ] #NEWLINE# for n in zerodegree : #NEWLINE# #INDENT# G . remove_node ( n ) #NEWLINE# #UNINDENT# U = nx . disjoint_union ( U , G ) #NEWLINE# #UNINDENT# C = nx . connected_component_subgraphs ( U ) #NEWLINE# UU = nx . Graph ( ) #NEWLINE# nlist = [ ] #NEWLINE# for G in C : #NEWLINE# #INDENT# if ( not iso ( G , nlist ) ) : #NEWLINE# #INDENT# nlist . append ( G ) #NEWLINE# UU = nx . disjoint_union ( UU , G ) #NEWLINE# #UNINDENT# #UNINDENT# return UU