天赋 无与伦比的坚持

Home Archives About Wiki
8月 16 2013
面试题

BFS和DFS算法温习

广度优先搜索BFS

给定无向图G和源点s,遍历图。
BFS(G,s)
for each vertex u in G
u.color = white //所有点置为未扫描
endif
s.color = black //设置源点s为当前扫描点
Q = new queue //新建空队列
Q.add(s) //加入源点s
while(Q)
u = Q.dequeue //取队列首节点
for each vertex v connect with u
if(v.color == white)
Q.add(v)
v.color = black
endif
endwhile
广度优先遍历演示地址

Read More

Share Comments
  • BFS
  • DFS

Categories

  • Networking3
  • Shell12
  • networking1
  • wiki-GIT5
  • wiki-network10
  • wiki-paper3
  • wiki-tools3
  • wiki-好文共享2
  • wiki-编程技艺1
  • wiki-阅读周记5
  • 博客搭建4
  • 读书笔记12
  • 面试题7

Recents

  • 使用ntopng监控网络信息
  • 获取亚太地区IP库
  • 阅读周记(第五期)
  • wiki-tool-iptraf
  • netstat -st输出解析(二)
  • netstat -s输出解析(一)
  • 阅读周记(第四期)
  • TCP Tail Loss Probe(TLP)
  • Early Retransmit for TCP
  • 在Linux上探测TCP的内部状态
  • 阅读周记(第三期)
  • 阅读周记(第二期)
  • 阅读周记(第一期)
  • 2015 Q2 Akamai互联网状态报告
  • 剖析free命令
↑

Tag Cloud

BFSC/C++CPUDFSEasyBCDGitJekyllKConKVMLinuxMSTMapreduceNATNTPOProfilePAWSPTPRTTMSACKTCPToolsX11YQLYUIapnicassemblychromecpucrashdevopsdigitaloceanexcelfastopenfreegitgooglehexohttp archivehttp2http_load

Archives

  • November 20157
  • October 20157
  • September 20156
  • August 20158
  • July 20151
  • June 20155
  • May 20151
  • March 20152
  • February 20152
  • January 20154
  • December 20143
  • November 20147
  • October 20143
  • June 20143
  • April 20142
  • December 20132
  • October 20131
  • September 20138
  • August 20139
  • July 20131
  • June 20133
  • May 20137
  • April 20139
  • March 201318
  • February 20132

访问统计

counter with different designs
© 2015 Perth Charles
Powered by Hexo
Home Archives About Wiki