/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

4 votes153 views3 answers
Find distance between two points in opencv python
TypeScript
0 vote167 views1 answer
How to use indexOf in typesript
TypeScript
0 vote197 views1 answer
Tar contents of current folder
TypeScript
1 vote148 views1 answer
Move items from one log to another typescript
TypeScript
-1 vote165 views1 answer
Apexcharts dataURI style
TypeScript
0 vote152 views1 answer
Slice string into segments of 2 characters
TypeScript
0 vote161 views2 answers
Preventing +,-,e from input ts
TypeScript
7 votes193 views4 answers
Array in typescript
TypeScript
0 vote156 views1 answer
Typescript list
TypeScript
1 vote148 views1 answer
E_MISSING_NAMED_MIDDLEWARE: Cannot find a middleware named "auth"
TypeScript