def edge_set(self):
return EdgeSet(self.edges)
def _generateEdgeSet(graph):
edgeSet = EdgeSet()
for vertex in graph.getVertices():
for edge in graph.getEdges(vertex):
edgeSet.addEdge(vertex, edge[0])
return edgeSet
def edge_set(self):
return EdgeSet(self.square.edges)
def _cross_edges_outgoing(self, cross: Cross):
edges = cross.edges.difference(self.square.edges)
return EdgeSet(edges)
def _cross_edges_common(self, cross: Cross):
edges = cross.edges.intersection(self.square.edges)
return EdgeSet(edges)
def _cross_edges_opposite(self, cross: Cross):
edges = self.square.edges.difference(cross.edges)
return EdgeSet(edges)
def _mid_edgeset(self):
edges = self.square1.edges.intersection(self.square2.edges)
return EdgeSet(edges)
def edge_set(self) -> EdgeSet:
return EdgeSet(set([self._outlier_edge()]))
def _opposite_edgeset(self):
edges = self._square_edges().difference(self._cross_edges())
return EdgeSet(edges)
def _edges_outgoing(self):
return EdgeSet(self.cross.edges.difference(self.square.edges))
def _edges_common(self):
return EdgeSet(self.square.edges.intersection(self.cross.edges))
def _edges_opposing(self):
return EdgeSet(self.square.edges - self.cross.edges)
def edge_set(self):
return EdgeSet(self.cross.edges.union(self.square.edges))