graph data structure python code example

Example 1: 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

Example 2: graph data structure in python

Graph implementation in Python 3.x using Adjacency Matrix at this link:
  
https://github.com/shreyasvedpathak/Data-Structure-Python/tree/master/Graph