/TypeScript/Representation of graph usig sets and hash in python

Representation of graph usig sets and hash in python

    def find_path(graph, start, end, path=[]):
        path = path + [start]
        if start == end:
            return path
        if not graph.has_key(start):
            return None
        for node in graph[start]:
            if node not in path:
                newpath = find_path(graph, node, end, path)
                if newpath: return newpath
        return None

Source: python.org

Similar codes

-1 vote149 views3 answers
Lodash merge array of objects without duplicates
TypeScript
2 votes151 views2 answers
Firestore cloud function update documents
TypeScript
13 votes173 views3 answers
How to check whether a string contains a substring in typescript online
TypeScript
0 vote157 views1 answer
When to choose automation over manual testing
TypeScript
57 votes361 views3 answers
How to check list of open ports in linux
TypeScript
7 votes151 views3 answers
How to call a function that other scripts can access in unity
TypeScript
0 vote142 views1 answer
Add correct host key in /root/.ssh/known_hosts to get rid of this message
TypeScript
0 vote197 views1 answer
Generate module in ionic 4|5|6
TypeScript
17 votes144 views3 answers
Js null ==
TypeScript
52 votes338 views6 answers
Length of an array javascript
TypeScript