Generated: 2025-09-28 20:27:50
Path State: Path is empty Frontier State: S3 Connected Processors: 0 ([]) Visited States: 0 Current canonical form: -1:3 Graph Adjacency List: Inlet → S3
Path State: S3 Frontier State: Frontier is empty Connected Processors: 2 ([0, 1]) Visited States: 1 Current canonical form: -1:3|3:0,1 Graph Adjacency List: Inlet → S3 S3 → P0, P1
Path State: S3 Frontier State: Frontier is empty Connected Processors: 2 ([0, 2]) Visited States: 1 Current canonical form: -1:3|3:0,2 Graph Adjacency List: Inlet → S3 S3 → P0, P2
Path State: S3 Frontier State: S4 Connected Processors: 1 ([0]) Visited States: 1 Current canonical form: -1:3|3:0,4 Graph Adjacency List: Inlet → S3 S3 → P0, S4
Path State: S3 → S4 Frontier State: Frontier is empty Connected Processors: 3 ([0, 1, 2]) Visited States: 2 Current canonical form: -1:3|3:0,4|4:1,2 Graph Adjacency List: Inlet → S3 S3 → P0, S4 S4 → P1, P2
Path State: S3 Frontier State: Frontier is empty Connected Processors: 2 ([1, 2]) Visited States: 2 Current canonical form: -1:3|3:1,2 Graph Adjacency List: Inlet → S3 S3 → P1, P2
Path State: S3 Frontier State: S4 Connected Processors: 1 ([1]) Visited States: 2 Current canonical form: -1:3|3:1,4 Graph Adjacency List: Inlet → S3 S3 → P1, S4
Path State: S3 Frontier State: S4 Connected Processors: 1 ([2]) Visited States: 3 Current canonical form: -1:3|3:2,4 Graph Adjacency List: Inlet → S3 S3 → P2, S4
Path State: Path is empty Frontier State: S4 Connected Processors: 0 ([]) Visited States: 0 Current canonical form: -1:4 Graph Adjacency List: Inlet → S4
Path State: S4 Frontier State: Frontier is empty Connected Processors: 2 ([0, 1]) Visited States: 1 Current canonical form: -1:4|4:0,1 Graph Adjacency List: Inlet → S4 S4 → P0, P1
Path State: S4 Frontier State: Frontier is empty Connected Processors: 2 ([0, 2]) Visited States: 1 Current canonical form: -1:4|4:0,2 Graph Adjacency List: Inlet → S4 S4 → P0, P2
Path State: S4 Frontier State: S3 Connected Processors: 1 ([0]) Visited States: 1 Current canonical form: -1:4|4:0,3 Graph Adjacency List: Inlet → S4 S4 → P0, S3
Path State: S4 Frontier State: Frontier is empty Connected Processors: 2 ([1, 2]) Visited States: 2 Current canonical form: -1:4|4:1,2 Graph Adjacency List: Inlet → S4 S4 → P1, P2
Path State: S4 Frontier State: S3 Connected Processors: 1 ([1]) Visited States: 2 Current canonical form: -1:4|4:1,3 Graph Adjacency List: Inlet → S4 S4 → P1, S3
Path State: S4 Frontier State: S3 Connected Processors: 1 ([2]) Visited States: 3 Current canonical form: -1:4|4:2,3 Graph Adjacency List: Inlet → S4 S4 → P2, S3
Path State: S4 → S3 Frontier State: Frontier is empty Connected Processors: 3 ([0, 1, 2]) Visited States: 4 Current canonical form: -1:4|3:0,1|4:2,3 Graph Adjacency List: Inlet → S4 S3 → P0, P1 S4 → P2, S3