Original question and givens
Use the complete finite undirected loop-free simple graph on Fin(7)={0,…,6} with edge set=[[0, 1], [2, 4], [2, 6], [3, 4], [3, 5]]. Loops and duplicate undirected edges are forbidden. Connectivity is complete path reachability, not just one traversal fragment. Length-zero paths make every vertex reachable from itself, including isolated vertices. Do not switch to directed weak/strong, infinite or dynamic connectivity. left=0, right=1. Give (left,right,left_component,same_component?).
G001 — Use the complete finite undirected loop-free simple graph on Fin(7)={0,…,6} with edge set=[[0, 1], [2, 4], [2, 6], [3, 4], [3, 5]]. Loops and duplicate undirected edges are forbidden. Connectivity is complete path reachability, not just one traversal fragment. Length-zero paths make every vertex reachable from itself, including isolated vertices. Do not switch to directed weak/strong, infinite or dynamic connectivity. left=0, right=1. Give (left,right,left_component,same_component?).
Step-by-step derivation
S001 · implies
Before
full carrier Fin(7);raw undirected edges=[[0, 1], [2, 4], [2, 6], [3, 4], [3, 5]]
After
canonical simple edges=[[0, 1], [2, 4], [2, 6], [3, 4], [3, 5]];full adjacency rows=[[1], [0], [4, 6], [4, 5], [2, 3], [3], [2]]
Conditions: none
Build adjacency on the full carrier,rejecting loops and duplicate undirected edges.Vertices absent from edges retain empty rows;do not switch to directed connectivity.
Step identifiers and dependencies
Rule: component_full_undirected_graph_includes_isolates · Uses: G001
S002 · implies
Before
left vertex:start vertex=0;complete adjacency=[[1], [0], [4, 6], [4, 5], [2, 3], [3], [2]]
After
initial visited=[0];path to start=[0];edge length0
Conditions: none
The start reaches itself by a length-zero path.Even an isolated vertex must be included rather than omitted for having no edges.
Step identifiers and dependencies
Rule: component_zero_length_reflexive_path · Uses: G001, S001
S003 · implies
Before
left vertex:layer=0;frontier=[0];all frontier neighbors=[1]
After
previously seen=[0];new vertices=[1]
Conditions: none
At each layer inspect every neighbor of every frontier vertex,then add only unvisited distinct labels.Do not stop at a plausible-looking fragment.
Step identifiers and dependencies
Rule: component_complete_frontier_expansion · Uses: G001, S002
S004 · implies
Before
left vertex:new vertex=1;earliest frontier parent=0;parent path=[0]
After
append actual parent edge;reachable path=[0, 1]
Conditions: none
Extend the established parent path by an original graph edge,so every added vertex really is reachable.
Step identifiers and dependencies
Rule: component_each_new_vertex_path_witness · Uses: G001, S003
S005 · implies
Before
left vertex:layer=1;frontier=[1];all frontier neighbors=[0]
After
previously seen=[0, 1];new vertices=[]
Conditions: none
At each layer inspect every neighbor of every frontier vertex,then add only unvisited distinct labels.Do not stop at a plausible-looking fragment.
Step identifiers and dependencies
Rule: component_complete_frontier_expansion · Uses: G001, S004
S006 · implies
Before
left vertex:final visited=[0, 1];all [vertex,neighbors,outside neighbors] rows=[[0, [1], []], [1, [0], []]]
After
no edge leaves visited;every visited vertex has a path;visited equals full reachable set
Conditions: none
Path witnesses give visited⊆reachable.At completion no edge leaves visited.If a path reached outside,it would have a first leaving edge,a contradiction,so reachable⊆visited.Both directions establish the whole component,not a traversal order.
Step identifiers and dependencies
Rule: component_reachable_and_closed_set_completeness · Uses: G001, S005
S007 · implies
Before
left=0;right=1;whole left component=[0, 1]
After
same component=Yes
Conditions: none
Compute the whole left component before testing the right label.Equal endpoints are connected by a zero-length path even if isolated.
Step identifiers and dependencies
Rule: component_membership_after_complete_reachability · Uses: G001, S006