/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 vote225 views4 answers
Pokediggerprank244
TypeScript
1 vote226 views1 answer
Size of list applescript
TypeScript
0 vote218 views1 answer
Add key value pair to all objects in array
TypeScript
1 vote209 views1 answer
Replace \n with breakline in type scripte
TypeScript
0 vote223 views1 answer
__redux_devtools_extension_compose__ typescript
TypeScript
0 vote220 views1 answer
Open ports for remote access on linux
TypeScript
0 vote204 views1 answer
How to print certain elements of an array
TypeScript
0 vote226 views1 answer
Typescript compare strings
TypeScript
0 vote222 views10 answers
Javascript to typescript converter online
TypeScript
-1 vote237 views1 answer
How to make dots react native
TypeScript