grapher.py

import networkx as nx
import matplotlib.pyplot as plt
import verilog_parser

'''
in_n: input nodes;
out_n: output nodes;
nodes: gates;
edges: wire connections
'''

def grapher(in_n, out_n, nodes, edges, verbose=0):

    G=nx.DiGraph()
    G.add_nodes_from(in_n)
    G.add_nodes_from(out_n)
    G.add_nodes_from(nodes)

    colour_map = []
    size = []
    for node in G:
        if node in in_n:
            colour_map.append('blue')
        elif node in out_n:
            colour_map.append('red')
        else:
            colour_map.append('green')
        size.append(530*len(node))

    for i in edges:
        for j in i[2]:
            G.add_edge(i[1], j, weight=6)

    if(verbose):
        import os
        term_size = os.get_terminal_size()
        
        print("\n")
        [print('-', end='') for i in range(int((term_size.columns-5)/2))]
        print("PATHS", end='')
        [print('-', end='') for i in range(int((term_size.columns-5)/2))]
        print("\n")
        
        for i in in_n:
            for j in out_n:
                for path in nx.all_simple_paths(G, source=i, target=j):
                    print(path)

        print()

    nx.draw(G, with_labels=True, node_color=colour_map, node_size=size, arrowsize=20, pos=nx.spring_layout(G, k=7))
    plt.show()