complete the following python code:

class Graph: def __init__(self, size, adjmat=[]) -> None: self.adjmat = adjmat self.size = size if not adjmat: for i in range(size): temp = [] for j in range(size): temp.append(0); self.adjmat.append(temp) def add_node(self, nodemat): for i in range(self.size): self.adjmat[i] = nodemat[i]; self.adjmat.append(nodemat); self.size+=1; def add_edge(self, node1: int, node2: int): self.adjmat[node1] = node2; self.adjmat[node2] = node1; def delete_node(self, node: int): for i in range(self.size): self.adjmat[i].pop(node) self.adjmat.pop(node) self.size-=1 def delete_edge(self, node1: int, node2: int): self.adjmat[node1][node2] = 0; self.adjmat[node2][node1] = 0; def get_adjacent_nodes(): pass def get_adjacent_paths(): pass