Exemplos de Maze.DFS em Python

Exemplo n.º 1

Arquivo: testDFS.py Projeto: michael5486/Design-and-Analysis-of-Algorithms

#Michael Esposito

from graph import Graph
from maze import Maze

#Graph size
graph = Graph(15)

#adding in edges
graph.add_bidirectional_edge(0, 1)
graph.add_bidirectional_edge(1, 3)
graph.add_bidirectional_edge(1, 2)
graph.add_bidirectional_edge(2, 10)
graph.add_bidirectional_edge(2, 9)
graph.add_bidirectional_edge(3, 4)
graph.add_bidirectional_edge(3, 7)
graph.add_bidirectional_edge(4, 12)
graph.add_bidirectional_edge(4, 5)
graph.add_bidirectional_edge(5, 6)
graph.add_bidirectional_edge(5, 13)
graph.add_bidirectional_edge(6, 11)
graph.add_bidirectional_edge(6, 8)
graph.add_bidirectional_edge(7, 14)

#startNode = 0. endNode = 7
maze = Maze(graph, 0, 7)

maze.print_maze()

maze.DFS()

Exemplo n.º 2

Arquivo: testRandomDFS.py Projeto: michael5486/Design-and-Analysis-of-Algorithms

def doRandom(graph_size, num_nodes):
    graph = Graph(graph_size)
    graph.make_random(num_nodes)
    maze = Maze(graph)
    # maze.print_maze()
    maze.DFS()