修题面中伪代码
  • 板块CF1707C DFS Trees
  • 楼主Imakf
  • 当前回复4
  • 已保存回复4
  • 发布时间2022/7/18 22:04
  • 上次更新2023/10/27 19:38:36
查看原帖
修题面中伪代码
47863
Imakf楼主2022/7/18 22:04

如题。@小粉兔 @离散小波变换°

vis := an array of length n
s := a set of edges

function dfs(u):
    vis[u] := true
    iterate through each edge (u, v) in the order from smallest to largest edge weight
        if vis[v] = false
            add edge (u, v) into the set (s)
            dfs(v)

function findMST(u):
    reset all elements of (vis) to false
    reset the edge set (s) to empty
    dfs(u)
    return the edge set (s)
2022/7/18 22:04
加载中...