Graph Build Debug Log

Generated: 2025-09-28 20:27:50

Call #1 - 20:27:50.331

Path State:
Path is empty

Frontier State:
S3

Connected Processors: 0 ([])
Visited States: 0
Current canonical form: -1:3

Graph Adjacency List:
Inlet → S3
InletP0P1P2S3S4

Call #2 - 20:27:50.331

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
InletP0P1P2S3S4

Call #3 - 20:27:50.332

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
InletP0P1P2S3S4

Call #4 - 20:27:50.332

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
InletP0P1P2S3S4

Call #5 - 20:27:50.432

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
InletP0P1P2S3S4

Call #6 - 20:27:50.433

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
InletP0P1P2S3S4

Call #7 - 20:27:50.433

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
InletP0P1P2S3S4

Call #8 - 20:27:50.433

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
InletP0P1P2S3S4

Call #9 - 20:27:50.433

Path State:
Path is empty

Frontier State:
S4

Connected Processors: 0 ([])
Visited States: 0
Current canonical form: -1:4

Graph Adjacency List:
Inlet → S4
InletP0P1P2S3S4

Call #10 - 20:27:50.433

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
InletP0P1P2S3S4

Call #11 - 20:27:50.433

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
InletP0P1P2S3S4

Call #12 - 20:27:50.433

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
InletP0P1P2S3S4

Call #13 - 20:27:50.433

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
InletP0P1P2S3S4

Call #14 - 20:27:50.433

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
InletP0P1P2S3S4

Call #15 - 20:27:50.433

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
InletP0P1P2S3S4

Call #16 - 20:27:50.534

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
InletP0P1P2S3S4