Skip to content
This repository has been archived by the owner on Jan 30, 2023. It is now read-only.

Commit

Permalink
Fixed a small error
Browse files Browse the repository at this point in the history
  • Loading branch information
meghanamreddy committed Jul 5, 2018
1 parent a1d1336 commit c5a73e9
Showing 1 changed file with 3 additions and 3 deletions.
6 changes: 3 additions & 3 deletions src/sage/graphs/connectivity.pyx
Original file line number Diff line number Diff line change
Expand Up @@ -2011,7 +2011,7 @@ class Triconnectivity:
self.t_stack_top = 0
self.t_stack_a[self.t_stack_top] = -1

#self.path_search(self.start_vertex)
self.path_search(self.start_vertex)

# Push a triple on Tstack
def tstack_push(self, h, a, b):
Expand Down Expand Up @@ -2487,7 +2487,7 @@ class Triconnectivity:
(self.parent[v] != self.start_vertex or outv >= 2):
# type-1 separation pair
print "Found type-1 separation pair (", self.node_at[self.lowpt1[w]], ", ", v, ")"
c = self.new_component()
comp = self.new_component()
if not self.e_stack: # OGDF_ASSERT
raise ValueError("stack is empty")
while self.e_stack:
Expand Down Expand Up @@ -2546,7 +2546,7 @@ class Triconnectivity:
adj.remove(it)
comp_bond = self.new_component([e_virt], type_c=0)
self.graph_copy.add_edge(self.node_at[self.lowpt1[w]], v)
e_virt = (self.node_at[self.lowpt1[w]], c, None)
e_virt = (self.node_at[self.lowpt1[w]], v, None)
comp_bond.add_edge(e_virt)

eh = self.tree_arc[v];
Expand Down

0 comments on commit c5a73e9

Please sign in to comment.