NetworkX函数'is_chordal'的复杂性

Question

我正在寻找method is_chordal of the NetworkX library

的复杂性

def is_chordal(G):
    if G.is_directed():
        raise nx.NetworkXError('Directed graphs not supported')
    if G.is_multigraph():
        raise nx.NetworkXError('Multiply connected graphs not supported.')
    if len(_find_chordality_breaker(G))==0:
        return True
    else:
        return False

有人可以帮我吗？