def residue(G):
L = degree_sequence(G)
Havel_Hakimi_process(L)
return len(L)
def residue(G):
D = degree_sequence(G)
Havel_Hakimi_Process(D)
return len(D)
import networkx as nx
from itertools import combinations
from functions.bool_functions import *
from functions.global_properties import degree_sequence
from functions.Havel_Hakimi import *
from matching import *
G = nx.read_edgelist('sample_graphs/sample_G.txt')
nx.draw_networkx(G)
D = degree_sequence(G)
print(is_matching(G))
def resid(G):
L = degree_sequence(G)
is_graphic(L)