visualizations

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

prim.py (2498B)

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