Method collectInnerEdges

src/qanGraph.cpp:2011–2040

}

auto    Graph::collectInnerEdges(const std::vector<const qan::Node*>& nodes) const -> std::unordered_set<const qan::Edge*>
{
    // Algorithm:
        // 0. Index nodes
        // 1. For every nodes:
            // 1.1 Collect all out edge where dst is part of nodes
            // 1.2 Collect all in edge where src is part of nodes
    std::unordered_set<const qan::Edge*>  innerEdges;
    if (nodes.size() == 0)
        return innerEdges;
    std::unordered_set<const qan::Node*>  nodesSet(nodes.cbegin(), nodes.cend());

    std::unordered_set<qan::Edge*>  edges;
    for (const auto node: nodes) {
        const auto& inEdges = node->get_in_edges();
        for (const auto inEdge: inEdges) {
            if (inEdge != nullptr &&
                nodesSet.find(inEdge->getDestination()) != nodesSet.end())
                innerEdges.insert(inEdge);
        }

        const auto& outEdges = node->get_out_edges();
        for (const auto outEdge: outEdges) {
            if (outEdge != nullptr &&
                nodesSet.find(outEdge->getSource()) != nodesSet.end())
                innerEdges.insert(outEdge);
        }
    }
    return innerEdges;
}

std::vector<const qan::Node*>   Graph::collectNeighbours(const qan::Node& node) const
{