| 33 | namespace { |
| 34 | |
| 35 | std::vector<GraphView::Edge> MakeEphemeralEdges( |
| 36 | const absl::Span<const TopologicalDependency> extra_dependencies) { |
| 37 | std::vector<GraphView::Edge> ephemeral_edges; |
| 38 | ephemeral_edges.reserve(extra_dependencies.size()); |
| 39 | for (const auto& dep : extra_dependencies) { |
| 40 | ephemeral_edges.emplace_back( |
| 41 | GraphView::OutputPort(dep.from, Graph::kControlSlot), |
| 42 | GraphView::InputPort(dep.to, Graph::kControlSlot)); |
| 43 | } |
| 44 | return ephemeral_edges; |
| 45 | } |
| 46 | |
| 47 | // Kahn's algorithm is implemented. |
| 48 | // For details, see https://en.wikipedia.org/wiki/Topological_sorting |
no test coverage detected