def main(): p1 = Node(0, "p1") p2 = Node(1, "p2") center = Node(2, "center") c1 = Node(3, "c1") c2 = Node(4, "c2") g = Graph({p1}) g.add_nodes({p2, center, c1, c2}) assert g.has_node(p1) assert g.contains({p1, center, c2}) center.add_neighbor(p1) center.add_neighbor(p2) center.add_neighbor(c1) center.add_neighbor(c2) g.draw(algo_num=1) path1 = '../examples_cbnets/graph1.dot' path2 = '../examples_cbnets/graph2.dot' g.write_dot(path1) new_g = Graph.read_dot(path1) new_g.write_dot(path2)
print("name: ", node.name) print("neighbors: ", sorted([x.name for x in node.neighbors])) print("\n") from nodes.Node import * if __name__ == "__main__": p1 = Node(0, "p1") p2 = Node(1, "p2") center = Node(2, "center") c1 = Node(3, "c1") c2 = Node(4, "c2") g = Graph({p1}) g.add_nodes({p2, center, c1, c2}) assert g.has_node(p1) assert g.contains({p1, center, c2}) center.add_neighbor(p1) center.add_neighbor(p2) center.add_neighbor(c1) center.add_neighbor(c2) g.draw(algo_num=1) path1 = '../examples_cbnets/graph1.dot' path2 = '../examples_cbnets/graph2.dot' g.write_dot(path1) new_g = Graph.read_dot(path1) new_g.write_dot(path2)
def createMap1(): # Define nodes. n0 = Node([0, 0]) # n1 = Node([0, 1]) n2 = Node([0, 2]) n3 = Node([0, 3]) n4 = Node([0, 4]) n5 = Node([1, 0]) # n6 = Node([1, 1]) n7 = Node([1, 2]) # n8 = Node([1, 3]) n9 = Node([1, 4]) n10 = Node([2, 0]) n11 = Node([2, 1]) n12 = Node([2, 2]) # n13 = Node([2, 3]) n14 = Node([2, 4]) n15 = Node([3, 0]) n16 = Node([3, 1]) n17 = Node([3, 2]) n18 = Node([3, 3]) n19 = Node([3, 4]) # Build map. n0.add_neighbor(n5) n5.add_neighbor(n0) n5.add_neighbor(n10) n10.add_neighbor(n5) n10.add_neighbor(n11) n10.add_neighbor(n15) n15.add_neighbor(n10) n15.add_neighbor(n16) n11.add_neighbor(n10) n11.add_neighbor(n12) n11.add_neighbor(n16) n16.add_neighbor(n11) n16.add_neighbor(n17) n16.add_neighbor(n15) n12.add_neighbor(n7) n12.add_neighbor(n17) n12.add_neighbor(n11) n17.add_neighbor(n12) n17.add_neighbor(n18) n17.add_neighbor(n16) n18.add_neighbor(n17) n18.add_neighbor(n19) n19.add_neighbor(n18) n19.add_neighbor(n14) n14.add_neighbor(n19) n14.add_neighbor(n9) n9.add_neighbor(n4) n9.add_neighbor(n14) n4.add_neighbor(n9) n4.add_neighbor(n3) n3.add_neighbor(n4) n3.add_neighbor(n2) n2.add_neighbor(n3) n2.add_neighbor(n7) n7.add_neighbor(n2) n7.add_neighbor(n12) return [n0, n2, n3, n4, n5, n7, n9, n10, n11, n12, n14, n15, n16, n17, n18, n19]
nx_graph = nx.read_dot(path) return cls.new_from_nx_graph(nx_graph) from nodes.Node import * if __name__ == "__main__": p1 = Node(0, "p1") p2 = Node(1, "p2") center = Node(2, "center") c1 = Node(3, "c1") c2 = Node(4, "c2") g = Graph({p1}) g.add_nodes({p2, center, c1, c2}) assert(g.has_node(p1)) assert(g.contains({p1, center, c2})) center.add_neighbor(p1) center.add_neighbor(p2) center.add_neighbor(c1) center.add_neighbor(c2) g.draw(algo_num=1) # double dot to get parent directory path1 = '../examples_cbnets/dot_test1.dot' path2 = '../examples_cbnets/dot_test2.dot' g.write_dot(path1) new_g = Graph.read_dot(path1) new_g.write_dot(path2)