/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

0 vote302 views1 answer
Which of the following statements will compile correctly?
TypeScript
0 vote302 views1 answer
Difference between statistical learning and machine learning
TypeScript
0 vote289 views1 answer
Tslint shows double quotes error prettier
TypeScript
0 vote295 views1 answer
Angular dictionary
TypeScript
0 vote331 views1 answer
Delphi call function from its name
TypeScript
1 vote293 views1 answer
Replace '\n' in string angular
TypeScript
1 vote290 views1 answer
Serenity.is Entity service async to sync requests
TypeScript
0 vote296 views2 answers
Typescript array of mixed types
TypeScript
4 votes338 views1 answer
Get back some commits git
TypeScript
0 vote315 views1 answer
Shortcut to remove unused imports in vscode
TypeScript