Test an empty trivial graph with no partitions.
| 115 | |
| 116 | // Test an empty trivial graph with no partitions. |
| 117 | TEST(PartitionTest, Nodes0PartitionNodes0) { |
| 118 | SimpleTestGraph graph; |
| 119 | std::vector<int> nodes_to_partition = {}; |
| 120 | std::vector<NodeSubset> generated_subgraphs; |
| 121 | PartitionGraph(graph, nodes_to_partition, &generated_subgraphs); |
| 122 | CheckPartitionSubgraphs(generated_subgraphs, {}); |
| 123 | } |
| 124 | |
| 125 | // Test a trivial graph with no node and only 1 tensor. |
| 126 | // The tensor is input & output of the graph at the same time. |
nothing calls this directly
no test coverage detected