(graph *Graph)
| 47 | } |
| 48 | |
| 49 | func graphDebugString(graph *Graph) string { |
| 50 | debug := "" |
| 51 | for i, node := range graph.Nodes { |
| 52 | debug += fmt.Sprintf("Node %d: %p\n", i, node) |
| 53 | } |
| 54 | |
| 55 | for i, node := range graph.Nodes { |
| 56 | debug += "\n" |
| 57 | debug += fmt.Sprintf("=== Node %d: %p ===\n", i, node) |
| 58 | debug += edgeMapsDebugString(node.In, node.Out) |
| 59 | } |
| 60 | return debug |
| 61 | } |
| 62 | |
| 63 | func expectedNodesDebugString(expected []expectedNode) string { |
| 64 | debug := "" |
no test coverage detected
searching dependent graphs…