New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

rewrite dfs to avoid O(N^2) #18

Open

krober10nd opened this issue Mar 11, 2021 · 0 comments

Collaborator

krober10nd commented Mar 11, 2021

so not quadratic complexity. Use NetworkX. https://networkx.org

def dfs(graph):
    seen = set()
    lifo = []
    start = random_node(graph)
    lifo.append(start)
    while lifo:
        n = lifo.pop()
        seen.add(n)
        for nei in neighbours(n, graph):
            if nei in seen:
                continue
            else:
                lifo.append(n)
    nflag = numpy.zeros(nnodes)
    nflag[list(seen)] = 1

The text was updated successfully, but these errors were encountered:

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment