/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 vote163 views1 answer
Rewrite requests htaccess
TypeScript
0 vote164 views1 answer
Typescript doesn't know type of HTML element
TypeScript
0 vote178 views1 answer
Highcharts print
TypeScript
0 vote173 views1 answer
Typescript number to hex string
TypeScript
0 vote163 views1 answer
Mat card api
TypeScript
1 vote194 views1 answer
Whats the biggest lesson to know if programming
TypeScript
0 vote162 views1 answer
Typescript exclamation mark
TypeScript
3 votes201 views1 answer
Intersection between two sets python
TypeScript
1 vote174 views1 answer
How to pass children in react typescript
TypeScript
0 vote164 views1 answer
Requirements check failed for jdk 8 (
TypeScript