/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

20 votes152 views10 answers
Nodemon
TypeScript
1 vote143 views1 answer
Typescript function parameters optional destruct
TypeScript
0 vote150 views1 answer
Creating different objects in node.js
TypeScript
0 vote151 views1 answer
Please fill in the missing parts of the code to print "I love C++" on the screen.
TypeScript
1 vote212 views1 answer
'mat-label' is not a known element:
TypeScript
0 vote299 views8 answers
Convert js to ts
TypeScript
0 vote137 views1 answer
How to change whats in a textarea
TypeScript
0 vote245 views1 answer
Gettime is not a function typescript
TypeScript
0 vote133 views1 answer
Input deno
TypeScript
0 vote130 views1 answer
Queryselectorall of multiple tags
TypeScript