rebuild_sort()

void MayaFlux::Nodes::Network::MeshNetwork::rebuild_sort ( )

private

Definition at line 187 of file MeshNetwork.cpp.

{
    // Kahn's algorithm: process roots first, then children.
    std::vector<uint32_t> in_degree(m_slots.size(), 0);
    for (const auto& slot : m_slots) {
        if (slot.parent_index.has_value())
            ++in_degree[slot.parent_index.value()];
    }
 
    // Roots: slots with no parent.
    std::vector<uint32_t> queue;
    for (uint32_t i = 0; i < static_cast<uint32_t>(m_slots.size()); ++i) {
        if (!m_slots[i].parent_index.has_value())
            queue.push_back(i);
    }
 
    m_sorted_indices.clear();
    m_sorted_indices.reserve(m_slots.size());
 
    while (!queue.empty()) {
        uint32_t idx = queue.front();
        queue.erase(queue.begin());
        m_sorted_indices.push_back(idx);
 
        for (uint32_t child : m_slots[idx].child_indices)
            queue.push_back(child);
    }
 
    if (m_sorted_indices.size() != m_slots.size()) {
        MF_ERROR(Journal::Component::Nodes, Journal::Context::Init,
            "MeshNetwork: slot DAG contains a cycle — sort is incomplete");
    }
 
    m_sort_dirty = false;
 
    MF_DEBUG(Journal::Component::Nodes, Journal::Context::Init,
        "MeshNetwork: rebuilt slot sort order ({} slots)", m_sorted_indices.size());
}

References MayaFlux::Journal::Init, m_slots, m_sort_dirty, m_sorted_indices, MF_DEBUG, MF_ERROR, and MayaFlux::Journal::Nodes.

Referenced by ensure_sorted(), and process_batch().

Here is the caller graph for this function: