def plot(self):
    plot graph
    nx.draw(self.G, with_labels = True)
    #nx.draw_kamada_kawai(self.G, with_labels = True)
    #plt.figure(1, figsize=(200, 80), dpi=60, font_weight='normal')
    #plt.figure(figsize=(280,80))
    plt.savefig("filename.png")

from tkinter.ttk import Notebook
import networkx as nx
import matplotlib.pyplot as plt
class Graph:
    create and visualize a graph using networkx
    def __init__(self):
        basic constructor
        self.G = nx.MultiDiGraph()
    def addNodes(self,nodes, options = {'color' : 'blue'}):
        add nodes to the graph
        #asserts
        assert(self.G is None, 'graph not created')
        assert(options is None, 'options  parameter is none type')
        assert(not isinstance(nodes, list), 'nodes parameter must be a list')
        #add nodes with options
        for n in nodes:
            opt = options
            opt['label'] = n
            self.G.add_nodes_from(
                [(n, opt)]
    def addEdges(self, edges, options = {'color' : 'green'}):
        add edges to the graph
        #asserts
        assert(self.G is None, 'graph not created')
        assert(options is None, 'options  parameter is none type')
        assert(not isinstance(edges, list), 'edges parameter must be a list')
        #add edges with options
        for n in edges:
            opt = options
            opt['label'] = n
            self.G.add_edges_from(
                [n + (options,)]
        print([n + (options,)])
        #self.G.add_edges_from(edges, options)
    def removeNodes(self, nodes):
        remove nodes from graph
        assert(self.G is None, 'graph not created')
        assert(not isinstance(nodes, list), 'nodes parameter must be a list')
        self.G.remove_nodes_from(nodes)
    def removeEdges(self,edges):
        remove edges from graph
        assert(self.G is None, 'graph not created')
        assert(not isinstance(edges, list), 'edges parameter must be a list')
        self.G.remove_edges_from(edges)
    def plot(self):
        plot graph
        nx.draw(self.G, with_labels = True)
        #nx.draw_kamada_kawai(self.G, with_labels = True)
        #plt.figure(1, figsize=(200, 80), dpi=60, font_weight='normal')
        #plt.figure(figsize=(280,80))
        plt.savefig("filename.png")
    def save_graph(self, filename):
        save graph to file
class CubeGraph(Graph):
    this class handles graphs for cubes
    def __init__(self, nodes, green_edges, red_edges):
        constructor for cube graph
        #asserts
        assert(not isinstance(nodes, list), 'nodes parameter must be a list')
        assert(not isinstance(green_edges, list), 'green_edges parameter must be a list')
        assert(not isinstance(red_edges, list), 'red_edges parameter must be a list')
        #assign variables
        self._nodes = nodes
        self._greenEdges = green_edges
        self._redEdges = red_edges
        #init parent object
        super().__init__()
    def createAll(self):
        create the graph with all the nodes and edges
        self.addNodes(self._nodes)
        self.addEdges(self._greenEdges, {'color' : 'green'})
        self.addEdges(self._redEdges, {'color' : 'red'})
    def create(self, node):
        create a graph only with related node
        assert(node in self._nodes, 'node parameter is not nodes list provided at initialization')
        #clean the graph
        self.removeEdges(self._redEdges)
        self.removeEdges(self._greenEdges)
        self.removeNodes(self._nodes)
        #make sure node is lower case
        node = node.lower()
        #filter only those edges matching the node
        green_filtered = list(filter(lambda x : x[0] == node, self._greenEdges))
        red_filtered = list(filter(lambda x : x[1] == node, self._redEdges))
        #add nodes and edges to graph
        self.addNodes(node)
        self.addEdges(green_filtered, {'color' : 'green'})
        self.addEdges(red_filtered, {'color' : 'red'})
number_of_nodes = 6
nodes = ['0000 very long and unique string number {}'.format(i) for i in range(0,number_of_nodes)]
green = []
red = []
green.append(('0000 very long and unique string number 0', '0000 very long and unique string number 1'))
red.append(('0000 very long and unique string number 1', '0000 very long and unique string number 0'))
green.append(('0000 very long and unique string number 2', '0000 very long and unique string number 3'))
red.append(('0000 very long and unique string number 3', '0000 very long and unique string number 2'))
green.append(('0000 very long and unique string number 4', '0000 very long and unique string number 5'))
red.append(('0000 very long and unique string number 5', '0000 very long and unique string number 4'))
net = CubeGraph(nodes, green, red)
net.createAll()
net.plot()
print('')