visualizations

Programmatic visualizations
git clone git://git.laack.co/visualizations.git
Log | Files | Refs | README

bfs.py (2345B)

      1 import pygame
      2 import time
      3 import heapq
      4 import random
      5 import math
      6 
      7 pygame.init()
      8 
      9 display = pygame.display.set_mode((5120,1440))
     10 
     11 VERTICES = 1000
     12 EDGES = 1000
     13 
     14 white = (255, 255, 255)
     15 red = (255, 0, 0)
     16 black = (0, 0, 0)
     17 grey = (100,100,100)
     18 light_grey = (0,0,0)
     19 
     20 
     21 class Vertex():
     22     def __init__(self, x, y):
     23         self.x = x
     24         self.y = y
     25         self.visited = False
     26 
     27     def draw_vertex(self,display):
     28         if self.visited:
     29             pygame.draw.circle(display, white, (self.x,self.y), 5)
     30         else:
     31             pygame.draw.circle(display, grey, (self.x,self.y), 5)
     32 
     33 class Edge():
     34     def __init__(self, v1, v2):
     35         self.v1 = v1
     36         self.v2 = v2
     37         self.dist = math.sqrt(((v1.x - v2.x) ** 2) + ((v1.y - v2.y) ** 2))
     38 
     39     def draw_edge(self,display, c):
     40         pygame.draw.line(display, c, (self.v1.x,self.v1.y), (self.v2.x,self.v2.y), 1)
     41 
     42     def __lt__(self,otr):
     43         return self.dist < otr.dist
     44 
     45 
     46 graph = {}
     47 for i in range(0,VERTICES):
     48     x = random.random() * 5120
     49     y = random.random() * 1440
     50     graph[Vertex(x,y)] = []
     51 
     52 
     53 edge_list = []
     54 for i in range(0,EDGES):
     55     k1 = None
     56     k2 = None
     57     while k1 == k2:
     58         k1 = random.choice(list(graph.keys()))
     59         k2 = random.choice(list(graph.keys()))
     60 
     61     edge = Edge(k1,k2)
     62     graph[k1].append(edge)
     63     graph[k2].append(edge)
     64     edge_list.append(edge)
     65 
     66 done = False
     67 
     68 
     69 
     70 start_node = list(graph.keys())[0]
     71 start_node.visited = True
     72 
     73 to_visit = []
     74 next_visit = [start_node]
     75 
     76 visited_edges = []
     77 already_seen = set()
     78 
     79 
     80 while True:
     81     for event in pygame.event.get():
     82         if event.type == pygame.QUIT:
     83             pygame.quit()
     84             quit()
     85 
     86     display.fill(black)
     87     for vertex in graph:
     88         vertex.draw_vertex(display)
     89     for edge in edge_list:
     90         edge.draw_edge(display, light_grey)
     91     for edge in visited_edges:
     92         edge.draw_edge(display, white)
     93 
     94     if done:
     95         pygame.display.update()
     96         pygame.image.save(display, "out.jpg")
     97         break
     98 
     99     to_visit = next_visit
    100     next_visit = []
    101     for next_node in to_visit:
    102         next_node.visited = True
    103         for edge in graph[next_node]:
    104             visited_edges.append(edge)
    105             if not edge.v2 in already_seen:
    106                 next_visit.append(edge.v2)
    107                 already_seen.add(edge.v2)
    108 
    109     time.sleep(1)
    110     pygame.display.update()