def test_add_vertex(self):
a = Vertex("a")
b = Vertex("b")
a.add_dart(b, 1)
g = Graph([a, b])
g.add_vertex("c")
self.assertTrue(len(g.vertices) == 3)
def build_graph(self):
graph = Graph()
for edge in self.graph_edges:
edge = edge.strip()
node_source = edge[0]
node_destination = edge[1]
edge_weight = edge[2]
graph.add_edge(node_source, node_destination, edge_weight)
return graph
def test_remove_vertex(self):
a = Vertex("a")
b = Vertex("b")
c = Vertex("c")
a.add_dart(b, 1)
a.add_dart(c, 1)
b.add_dart(c, 1)
g = Graph([a, b, c])
g.remove_vertex("a")
self.assertTrue(len(g.vertices) == 2)
self.assertTrue(len(g.get_vertex("b").neighbors) == 1)
self.assertTrue(len(g.get_vertex("c").neighbors) == 0)
def __init__(self, agent, kb, env):
super(GraphNeuralSession, self).__init__(agent, kb, env)
self.graph = GraphBatch([Graph(kb)])
self.utterances = None
self.context = None
self.graph_data = None
self.init_checklists = None
def find_envelope(self, alt: float, plot=False, line=1):
if plot:
self.visualization.initialize_plot()
td = self.makedata.td_all(alt)
tr = self.makedata.tr_all(alt)
graph = Graph(line1=td,
line2=tr,
abscissa=self.makedata.airplane.velocities)
intersections = self.intersection.intersections(graph=graph)
self.add_intersections(line=line,
alt=alt,
inter=intersections,
debug=True)
if plot:
self.visualization.show_envelope(alt)
def create_graph(self):
assert not hasattr(self, 'graphs')
self.graphs = [Graph(kb) for kb in self.kbs]
def __g1_grid_graph__(m, n):
"""
Create m x n grid graph with genus 1.
1st row and last column are the homology cycles.
Bottom left face is the MSSP face with top right vertex of this face being the first source.
:param m:
:param n:
:return:
"""
# Generate vertices and faces.
vs = [[Vertex((i, j)) for j in range(n)] for i in range(m)]
fs = [[Vertex((i, j)) for j in range(n)] for i in range(m)]
# Generate all edges and its duals.
for i in range(m):
for j in range(n):
v = vs[i][j]
# Dart (i, j) -> (i + 1, j), its reverse, dual, dual reverse.
neighbor = vs[(i + 1) % m][j] # Compute left and right face coordinates.
left = fs[i][j]
right = fs[i][(j - 1) % n]
if i == m - 1:
Edge(v, neighbor, Weight(1, [0, -1], 0), left, right)
else:
Edge(v, neighbor, Weight(1, [0, 0], 0), left, right)
# Dart (i, j) -> (i, j + 1), its reverse, dual, dual reverse.
neighbor = vs[i][(j + 1) % n] # Compute left and right face coordinates.
left = fs[(i - 1) % m][j]
right = fs[i][j]
if j == n - 1:
Edge(v, neighbor, Weight(1, [1, 0], 0), left, right)
else:
Edge(v, neighbor, Weight(1, [0, 0], 0), left, right)
graph = Graph(vertices=sum(vs, []), faces=sum(fs, []), genus=1)
# Num Edge(spanning tree) + Num edges(dual spanning tree) + 2 * g
# Spanning tree in original graph. Note that we first remove non-trivial homology edges from graph prior to
# computing spanning tree.
# TODO(lkhamsurenl): Figure out a way to find Spanning tree without explicit copy of the entire graph.
c_st = copy.deepcopy(graph)
for i in range(m):
c_u = c_st.get_vertex((i, n - 1))
c_v = c_st.get_vertex((i, 0))
__remove_edge__(c_u, c_v)
for j in range(n):
c_u = c_st.get_vertex((m - 1, j))
c_v = c_st.get_vertex((0, j))
__remove_edge__(c_u, c_v)
# Get spanning tree by computing BFS, starting at the current root.
# NOTE(lkhamsurenl): Assume root is at (1, 1).
spanning_tree = bfs(c_st.get_vertex((1, 1)))
# Dual spanning tree. Note that we remove all edges in spanning tree and 2g auxiliary edges (which in our case:
# (0, n-1) -> (0, 0) and (m-1, 0) -> (0, 0)).
c_g = copy.deepcopy(graph)
for v_name in spanning_tree:
u_name = spanning_tree[v_name]
if u_name != None:
__remove_edge__(c_g.get_vertex(u_name), c_g.get_vertex(v_name))
__remove_edge__(c_g.get_vertex((0, n - 1)), c_g.get_vertex((0, 0)))
__remove_edge__(c_g.get_vertex((m - 1, 0)), c_g.get_vertex((0, 0)))
# Compute dual spanning tree by computing BFS rooted at (0, 0) face.
# NOTE(lkhamsurenl): Assume root is at face (0, 0).
dual_spanning_tree = bfs(c_g.get_face((0, 0)))
leafmost = __compute_leafmost__(dual_spanning_tree)
for (u_name, v_name) in leafmost:
if u_name != None:
u = graph.get_face(u_name)
v = graph.get_face(v_name)
dart = u.neighbors[v]
dart.weight = Weight(dart.weight.length, dart.weight.homology, leafmost[(u_name, v_name)])
# Create reverse, dual, dual reverse respectively with corresponding leafmost terms.
Edge(dart.tail, dart.head, dart.weight, dart.dual.tail, dart.dual.head)
return graph
def __g2_grid_graph__(m, n):
"""
Manually create m by n grid graph with genus 2.
:return: Graph.
"""
assert m == 6 and n == 6, "We only support m = 6, n = 6 option for now."
# Build vertices and faces.
vertices = [[Vertex((i, j)) for j in range(6)] for i in range(6)]
faces = [[Vertex((i, j)) for j in range(6)] for i in range(6)]
# Build darts, its reverse, dual and dual reverse respectively.
Edge(vertices[0][0], vertices[0][1], Weight(1, [0, 0, 0, 0], 0), faces[5][3], faces[0][0])
Edge(vertices[0][0], vertices[1][0], Weight(1, [0, 0, 0, 0], 0), faces[0][0], faces[3][5])
Edge(vertices[1][0], vertices[1][1], Weight(1, [0, 0, 0, 0], 0), faces[0][0], faces[1][0])
Edge(vertices[1][0], vertices[2][0], Weight(1, [0, 0, 0, 0], 0), faces[1][0], faces[4][5])
Edge(vertices[2][0], vertices[2][1], Weight(1, [0, 0, 0, 0], 0), faces[1][0], faces[2][0])
Edge(vertices[2][0], vertices[0][0], Weight(1, [0, -1, 0, 0], 0), faces[2][0], faces[5][5])
Edge(vertices[0][0], vertices[3][1], Weight(1, [0, 1, 0, 0], 0), faces[2][0], faces[3][0])
Edge(vertices[0][0], vertices[4][0], Weight(1, [0, 0, 0, 0], 0), faces[3][0], faces[0][5])
Edge(vertices[4][0], vertices[4][1], Weight(1, [0, 1, 0, 0], 0), faces[3][0], faces[4][0])
Edge(vertices[4][0], vertices[5][0], Weight(1, [0, 0, 0, 0], 0), faces[4][0], faces[1][5])
Edge(vertices[5][0], vertices[5][1], Weight(1, [0, 1, 0, 0], 0), faces[4][0], faces[5][0])
Edge(vertices[5][0], vertices[0][0], Weight(1, [0, 0, -1, 0], 0), faces[5][0], faces[2][5])
Edge(vertices[0][1], vertices[0][2], Weight(1, [0, 0, 0, 0], 0), faces[5][4], faces[0][1])
Edge(vertices[0][1], vertices[1][1], Weight(1, [0, 0, 0, 0], 0), faces[0][1], faces[0][0])
Edge(vertices[1][1], vertices[1][2], Weight(1, [0, 0, 0, 0], 0), faces[0][1], faces[1][1])
Edge(vertices[1][1], vertices[2][1], Weight(1, [0, 0, 0, 0], 0), faces[1][1], faces[1][0])
Edge(vertices[2][1], vertices[2][2], Weight(1, [0, 0, 0, 0], 0), faces[1][1], faces[2][1])
Edge(vertices[2][1], vertices[3][1], Weight(1, [0, 0, 0, 0], 0), faces[2][1], faces[2][0])
Edge(vertices[3][1], vertices[3][2], Weight(1, [0, 0, 0, 0], 0), faces[2][1], faces[3][1])
Edge(vertices[3][1], vertices[4][1], Weight(1, [0, 0, 0, 0], 0), faces[3][1], faces[3][0])
Edge(vertices[4][1], vertices[4][2], Weight(1, [0, 0, 0, 0], 0), faces[3][1], faces[4][1])
Edge(vertices[4][1], vertices[5][1], Weight(1, [0, 0, 0, 0], 0), faces[4][1], faces[4][0])
Edge(vertices[5][1], vertices[5][2], Weight(1, [0, 0, 0, 0], 0), faces[4][1], faces[5][1])
Edge(vertices[5][1], vertices[0][4], Weight(1, [0, -1, -1, 0], 0), faces[5][1], faces[5][0])
Edge(vertices[0][2], vertices[0][0], Weight(1, [1, 0, 0, 0], 0), faces[5][5], faces[0][2])
Edge(vertices[0][2], vertices[1][2], Weight(1, [0, 0, 0, 0], 0), faces[0][2], faces[0][1])
Edge(vertices[1][2], vertices[1][3], Weight(1, [0, 0, 0, 0], 0), faces[0][2], faces[1][2])
Edge(vertices[1][2], vertices[2][2], Weight(1, [0, 0, 0, 0], 0), faces[1][2], faces[1][1])
Edge(vertices[2][2], vertices[2][3], Weight(1, [0, 0, 0, 0], 0), faces[1][2], faces[2][2])
Edge(vertices[2][2], vertices[3][2], Weight(1, [0, 0, 0, 0], 0), faces[2][2], faces[2][1])
Edge(vertices[3][2], vertices[3][3], Weight(1, [0, 0, 0, 0], 0), faces[2][2], faces[3][2])
Edge(vertices[3][2], vertices[4][2], Weight(1, [0, 0, 0, 0], 0), faces[3][2], faces[3][1])
Edge(vertices[4][2], vertices[4][3], Weight(1, [0, 0, 0, 0], 0), faces[3][2], faces[4][2])
Edge(vertices[4][2], vertices[5][2], Weight(1, [0, 0, 0, 0], 0), faces[4][2], faces[4][1])
Edge(vertices[5][2], vertices[5][3], Weight(1, [0, 0, 0, 0], 0), faces[4][2], faces[5][2])
Edge(vertices[5][2], vertices[0][5], Weight(1, [0, -1, -1, 0], 0), faces[5][2], faces[5][1])
Edge(vertices[0][0], vertices[0][4], Weight(1, [0, 0, 0, 0], 0), faces[5][0], faces[0][3])
Edge(vertices[0][0], vertices[1][3], Weight(1, [-1, 0, 0, 0], 0), faces[0][3], faces[0][2])
Edge(vertices[1][3], vertices[1][4], Weight(1, [0, 0, 0, 0], 0), faces[0][3], faces[1][3])
Edge(vertices[1][3], vertices[2][3], Weight(1, [0, 0, 0, 0], 0), faces[1][3], faces[1][2])
Edge(vertices[2][3], vertices[2][4], Weight(1, [0, 0, 0, 0], 0), faces[1][3], faces[2][3])
Edge(vertices[2][3], vertices[3][3], Weight(1, [0, 0, 0, 0], 0), faces[2][3], faces[2][2])
Edge(vertices[3][3], vertices[3][4], Weight(1, [0, 0, 0, 0], 0), faces[2][3], faces[3][3])
Edge(vertices[3][3], vertices[4][3], Weight(1, [0, 0, 0, 0], 0), faces[3][3], faces[3][2])
Edge(vertices[4][3], vertices[4][4], Weight(1, [0, 0, 0, 0], 0), faces[3][3], faces[4][3])
Edge(vertices[4][3], vertices[5][3], Weight(1, [0, 0, 0, 0], 0), faces[4][3], faces[4][2])
Edge(vertices[5][3], vertices[5][4], Weight(1, [0, 0, 0, 0], 0), faces[4][3], faces[5][3])
Edge(vertices[5][3], vertices[0][0], Weight(1, [0, -1, -1, 1], 0), faces[5][3], faces[5][2])
Edge(vertices[0][4], vertices[0][5], Weight(1, [0, 0, 0, 0], 0), faces[5][1], faces[0][4])
Edge(vertices[0][4], vertices[1][4], Weight(1, [-1, 0, 0, 0], 0), faces[0][4], faces[0][3])
Edge(vertices[1][4], vertices[1][5], Weight(1, [0, 0, 0, 0], 0), faces[0][4], faces[1][4])
Edge(vertices[1][4], vertices[2][4], Weight(1, [0, 0, 0, 0], 0), faces[1][4], faces[1][3])
Edge(vertices[2][4], vertices[2][5], Weight(1, [0, 0, 0, 0], 0), faces[1][4], faces[2][4])
Edge(vertices[2][4], vertices[3][4], Weight(1, [0, 0, 0, 0], 0), faces[2][4], faces[2][3])
Edge(vertices[3][4], vertices[3][5], Weight(1, [0, 0, 0, 0], 0), faces[2][4], faces[3][4])
Edge(vertices[3][4], vertices[4][4], Weight(1, [0, 0, 0, 0], 0), faces[3][4], faces[3][3])
Edge(vertices[4][4], vertices[4][5], Weight(1, [0, 0, 0, 0], 0), faces[3][4], faces[4][4])
Edge(vertices[4][4], vertices[5][4], Weight(1, [0, 0, 0, 0], 0), faces[4][4], faces[4][3])
Edge(vertices[5][4], vertices[5][5], Weight(1, [0, 0, 0, 0], 0), faces[4][4], faces[5][4])
Edge(vertices[5][4], vertices[0][1], Weight(1, [0, -1, -1, 1], 0), faces[5][4], faces[5][3])
Edge(vertices[0][5], vertices[0][0], Weight(1, [0, 0, 0, 1], 0), faces[5][2], faces[0][5])
Edge(vertices[0][5], vertices[1][5], Weight(1, [-1, 0, 0, 0], 0), faces[0][5], faces[0][4])
Edge(vertices[1][5], vertices[4][0], Weight(1, [1, 0, 0, 1], 0), faces[0][5], faces[1][5])
Edge(vertices[1][5], vertices[2][5], Weight(1, [0, 0, 0, 0], 0), faces[1][5], faces[1][4])
Edge(vertices[2][5], vertices[5][0], Weight(1, [1, 0, 0, 1], 0), faces[1][5], faces[2][5])
Edge(vertices[2][5], vertices[3][5], Weight(1, [0, 0, 0, 0], 0), faces[2][5], faces[2][4])
Edge(vertices[3][5], vertices[0][0], Weight(1, [1, 0, -1, 1], 0), faces[2][5], faces[3][5])
Edge(vertices[3][5], vertices[4][5], Weight(1, [0, 0, 0, 0], 0), faces[3][5], faces[3][4])
Edge(vertices[4][5], vertices[1][0], Weight(1, [1, 0, -1, 1], 0), faces[3][5], faces[4][5])
Edge(vertices[4][5], vertices[5][5], Weight(1, [0, 0, 0, 0], 0), faces[4][5], faces[4][4])
Edge(vertices[5][5], vertices[2][0], Weight(1, [1, 0, -1, 1], 0), faces[4][5], faces[5][5])
Edge(vertices[5][5], vertices[0][2], Weight(1, [0, -1, -1, 1], 0), faces[5][5], faces[5][4])
graph = Graph(vertices=sum(vertices, []), faces=sum(faces, []), genus=2)
# Num Edge(spanning tree) + Num edges(dual spanning tree) + 2 * g
# Spanning tree in original graph.
# TODO(lkhamsurenl): Figure out a way to find Spanning tree without explicit copy of the entire graph.
c_st = copy.deepcopy(graph)
# Get spanning tree by computing BFS, starting at the current root.
# NOTE(lkhamsurenl): Assume root is at (1, 1).
spanning_tree = bfs(c_st.get_vertex((1, 1)))
# Dual spanning tree.
c_g = copy.deepcopy(graph)
for v_name in spanning_tree:
u_name = spanning_tree[v_name]
if u_name != None:
__remove_edge__(c_g.get_vertex(u_name), c_g.get_vertex(v_name))
# Compute dual spanning tree by computing BFS rooted at (0, 0) face.
# NOTE(lkhamsurenl): Assume root is at face (0, 0).
dual_spanning_tree = bfs(c_g.get_face((0, 0)))
leafmost = __compute_leafmost__(dual_spanning_tree)
for (u_name, v_name) in leafmost:
if u_name != None:
u = graph.get_face(u_name)
v = graph.get_face(v_name)
dart = u.neighbors[v]
dart.weight = Weight(dart.weight.length, dart.weight.homology, leafmost[(u_name, v_name)])
# Create reverse, dual, dual reverse respectively with corresponding leafmost terms.
Edge(dart.tail, dart.head, dart.weight, dart.dual.tail, dart.dual.head)
return graph