def newDFS(graph, source):
"""
Crea una busqueda DFS para un grafo y un vertice origen
"""
prime = nextPrime (g.numVertex(graph) * 2)
search={'graph':graph, 's':source, 'visitedMap':None}
search['visitedMap'] = map.newMap(numelements=prime, maptype='PROBING', comparefunction=graph['comparefunction'])
map.put(search['visitedMap'],source, {'marked':True,'edgeTo':None})
dfs(search, source)
return search
def numVertex(graph):
"""
Retorna el numero de vertices en el grafo graph
"""
if (graph['type'] == "ADJ_LIST"):
return alt.numVertex(graph)