benchmark.py

import math
import time
import random
import statistics

# Import the algorithms we want to test
from src.a_star import *
from src.a_star_variants import *

# Importing the map
from maze.diagrams import *


# Load the functions
functions = [a_star_search, bidirectional_a_star,
             weighted_a_star, dynamic_weighted_astar]
#functions = [a_star_search]

# print(type(functions))
times = {f.__name__: [] for f in functions}
path = {f.__name__: 0 for f in functions}

# Running the tests
graph = diagram5
start, goal = (1, 4), (38, 28)

for i in range(200):
    for _ in range(len(functions)):
        func = random.choice(functions)
        t0 = time.time()
        distance = func(diagram3, start, goal)
        t1 = time.time()
        times[func.__name__].append((t1 - t0) * 1000)
        path[func.__name__] = path[func.__name__] + len(distance)


for name, numbers in times.items():
    print('FUNCTION:', name, 'Used', len(numbers), 'times')
    print('\tMEDIAN', statistics.median(numbers))
    print('\tMEAN  ', statistics.mean(numbers))
    print('\tSTDEV ', statistics.stdev(numbers))
    print('\tAVG PATH', path[name] / len(numbers))