jyapayne/langflow
1
0
Fork 0
Code Issues Pull requests Projects Releases 1 Packages Wiki Activity Actions

Change how sort_up_to_vertex works

Browse source
This commit is contained in:
Gabriel Luiz Freitas Almeida 2024-03-01 22:51:30 -03:00
commit 457934b9d9
1 changed files with 3 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

10
src/backend/langflow/graph/graph/base.py
View file

@ -243,7 +243,7 @@ class Graph:
self.edges = new_edges
def vertex_data_is_identical(self, vertex: Vertex, other_vertex: Vertex) -> bool:
data_is_equivalent = vertex.__repr__() == other_vertex.__repr__()
data_is_equivalent = vertex == other_vertex
if not data_is_equivalent:
return False
return self.vertex_edges_are_identical(vertex, other_vertex)
@ -635,12 +635,8 @@ class Graph:
# Assuming get_predecessors is a method that returns all vertices with edges to current_vertex
for predecessor in current_vertex.predecessors:
stack.append(predecessor.id)
if current_id != vertex_id:
# Get the successors of the current vertex
for successor in current_vertex.successors:
if successor.id not in visited:
stack.append(successor.id)
else:
if current_id == vertex_id:
# We should add to visited all the vertices that are successors of the current vertex
# and their successors and so on
for successor in current_vertex.successors: