グラフ探索たんさく（BFS）

#entry main
#indent 4
#target std

#import "core/math" as *
#import "core/field" as *
#import "alloc/collections/vec" as *
#import "kp/kpgraph" as *
#import "std/stdio" as *

fn print_dist <(Vec<i32>)*>()> (dist):
    let n <i32> vec_len<i32> dist;
    let mut i <i32> 0;
    while lt i n:
        do:
            if lt 0 i:
                then print " "
                else ()
            print_i32 unwrap<i32> vec_get<i32> dist i;
            set i add i 1;
    println ""

fn main <()*> ()> ():
    let g <DenseGraph> dense_graph_new 4;
    dense_graph_add_undirected g 0 1;
    dense_graph_add_undirected g 1 2;
    dense_graph_add_undirected g 2 3;
    let dist <Vec<i32>> dense_graph_bfs_dist_raw get g "n" get g "mat" 0;
    print_dist dist;
    dense_graph_free g