/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 vote286 views3 answers
Typescript range
TypeScript
1 vote299 views1 answer
React filter contains
TypeScript
0 vote283 views2 answers
Python combine two lists into matrix
TypeScript
0 vote284 views1 answer
Check in Recat if an url is of image or video
TypeScript
34 votes288 views4 answers
How to get duplicate elements in sql
TypeScript
-1 vote285 views1 answer
How to separate a string into 2 lists of numbers and letters python
TypeScript
3 votes266 views1 answer
Typescript pass a function as an argunetn
TypeScript
3 votes264 views1 answer
Intersect sets python
TypeScript
-1 vote266 views1 answer
How to install typescript on linux
TypeScript
1 vote216 views1 answer
How to find array length
TypeScript