vortex-array 0.54.0

Vortex in memory columnar data format
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53

// SPDX-License-Identifier: Apache-2.0
// SPDX-FileCopyrightText: Copyright the Vortex contributors

use std::collections::VecDeque;

use vortex_error::{VortexResult, vortex_bail};

use crate::pipeline::operator::{NodeId, PipelineNode};

/// Topological sort for execution order
pub(super) fn topological_sort(dag: &[PipelineNode]) -> VortexResult<Vec<NodeId>> {
    let mut in_degree = vec![0; dag.len()];
    let mut queue = VecDeque::new();
    let mut result = Vec::new();

    // Calculate in-degrees
    for node in dag {
        for &child in &node.children {
            in_degree[child] += 1;
        }
    }

    // Find nodes with no dependencies
    for (idx, &degree) in in_degree.iter().enumerate() {
        if degree == 0 {
            queue.push_back(idx);
        }
    }

    // Process nodes in topological order
    while let Some(idx) = queue.pop_front() {
        result.push(idx);

        for &child in &dag[idx].children {
            in_degree[child] -= 1;
            if in_degree[child] == 0 {
                queue.push_back(child);
            }
        }
    }

    if result.len() != dag.len() {
        vortex_bail!(
            "Cycle detected in DAG: expected {} nodes, found {}",
            dag.len(),
            result.len()
        );
    }

    // Reverse to get a bottom-up execution order
    result.reverse();
    Ok(result)
}