| 79 | } |
| 80 | |
| 81 | void Graph::AddEdge(Node* tail, Node* head, std::uint32_t weight) { |
| 82 | for (const auto& it : tail->outedges) { |
| 83 | if (it->head == head) { |
| 84 | it->AddSequence(sequences_.size(), weight); |
| 85 | return; |
| 86 | } |
| 87 | } |
| 88 | edges_.emplace_back(new Edge(tail, head, sequences_.size(), weight)); |
| 89 | tail->outedges.emplace_back(edges_.back().get()); |
| 90 | head->inedges.emplace_back(edges_.back().get()); |
| 91 | } |
| 92 | |
| 93 | Graph::Node* Graph::AddSequence( |
| 94 | const char* sequence, |
no test coverage detected