Commit ab97c73

committed

Add Graph Visualization and Adjustments

1 parent ae2a82d commit ab97c73Copy full SHA for ab97c73

File tree

+37

-4

lines changed

+37

-4

lines changed

Lines changed: 10 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,6 +5,7 @@`
`5`	`5`	`from EagerNaivePrims import prims_mst as eager_naive_prims`
`6`	`6`	`from BinaryHeapPrims import prims_mst as binary_heap_prims`
`7`	`7`	`from FibHeapPrims import prims_mst as fib_heap_prims`
	`8`	`+from VisualizeMst import visualize`
`8`	`9`
`9`	`10`	`def read(grf):`
`10`	`11`
`@@ -24,22 +25,27 @@ def read(grf):`
`24`	`25`	`exit()`
`25`	`26`
`26`	`27`	`def main():`
	`28`	`+ grf = Graph(representation = "matrix")`
	`29`	`+ read(grf)`
	`30`	`+ adj_mat = grf.change_representation()`
	`31`	`+`
`27`	`32`	`prims = [lazy_naive_prims, eager_naive_prims, binary_heap_prims, fib_heap_prims][2]`
`28`	`33`	`representation = {lazy_naive_prims: "matrix",`
`29`	`34`	`eager_naive_prims: "matrix",`
`30`	`35`	`binary_heap_prims: "lists",`
`31`	`36`	`fib_heap_prims: "lists"} [prims]`
`32`	`37`
`33`		`- grf = Graph(representation = representation)`
`34`		`- read(grf)`
`35`		`-`
`36`	`38`	`start = time()`
`37`	`39`	`precursor = prims(grf)`
`38`	`40`	`end = time()`
`39`	`41`
`40`	`42`	`mst, cost = compute_mst_and_cost(precursor, grf)`
`41`		`-`
	`43`	`+`
`42`	`44`	`print(f"Cost = {cost}")`
`43`	`45`	`print(f"Duration: {(end - start) * 10**(9) : .0f} ns")`
`44`	`46`
	`47`	`+ edges_in_mst = [(ind, precursor[ind]) for ind in range(1, grf.nfverts)]`
	`48`	`+`
	`49`	`+ visualize(adj_mat, edges_in_mst)`
	`50`	`+`
`45`	`51`	`main()`

Lines changed: 6 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -51,14 +51,18 @@ def inner_loop(u):`
`51`	`51`	`inner_loop(u)`
`52`	`52`
`53`	`53`	`def change_representation(self):`
	`54`	`+ # Changes representation from matrix to lists or vice versa`
	`55`	`+ # and returns old representation`
`54`	`56`
`55`	`57`	`if self.representation == "matrix":`
`56`	`58`	`adj_lists = defaultdict(dict)`
`57`	`59`	`for i, row in enumerate(self.graph):`
`58`	`60`	`for j, ele in enumerate(row):`
`59`	`61`	`if ele != 0: adj_lists[i][j] = ele`
	`62`	`+ temp = self.graph`
`60`	`63`	`self.graph = adj_lists`
`61`	`64`	`self.representation = "lists"`
	`65`	`+ return temp`
`62`	`66`
`63`	`67`	`else:`
`64`	`68`	`adj_mat = []`
`@@ -71,8 +75,10 @@ def change_representation(self):`
`71`	`75`	`ele = 0`
`72`	`76`	`row.append(ele)`
`73`	`77`	`adj_mat.append(row)`
	`78`	`+ temp = self.graph`
`74`	`79`	`self.graph = adj_mat`
`75`	`80`	`self.representation = "matrix"`
	`81`	`+ return temp`
`76`	`82`
`77`	`83`	`def fill_with_zeros(self):`
`78`	`84`	`# Fill the adjacency matrix with zeros to initialize mst.`

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+import networkx as nx`
	`2`	`+import matplotlib.pyplot as plt`
	`3`	`+import numpy as np`
	`4`	`+from Graph import Graph as myGraph`
	`5`	`+from sys import stdin`
	`6`	`+`
	`7`	`+def visualize(matrix, edges_in_mst):`
	`8`	`+`
	`9`	`+ grf = nx.from_numpy_matrix(np.array(matrix))`
	`10`	`+`
	`11`	`+ pos = nx.spring_layout(grf)`
	`12`	`+ edge_labels = nx.get_edge_attributes(grf, 'weight')`
	`13`	`+`
	`14`	`+ nx.draw_networkx_nodes(grf, pos, node_color = 'pink')`
	`15`	`+ nx.draw_networkx_labels(grf, pos)`
	`16`	`+ nx.draw_networkx_edges(grf, pos, edge_color = 'purple', width = 1.5) # show all edges, thin lines`
	`17`	`+ nx.draw_networkx_edges(grf, pos, edgelist = edges_in_mst, edge_color = 'red', width = 2.5) # highlight mst`
	`18`	`+ nx.draw_networkx_edge_labels(grf, pos, edge_labels = edge_labels)`
	`19`	`+`
	`20`	`+ plt.show()`
	`21`	`+`

Comments

(0)