August 2017
Intermediate to advanced
360 pages
8h 35m
Chinese
Content preview from 算法技术手册（原书第2 版）
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
136
｜
第
6
章
//
一旦递归调用结束，回退到相邻顶点
if (color[v] == White) {
pred[v] = u;
dfsVisit (graph, v, pred, color);
}
}
color[u] = Black; //
在所有邻接顶点完成后，将自身标记为完成
}
/**
*
从顶点
s
处理深度优先搜索并计算
pred[u]
，用于记录结果深度优先搜索森林中顶点
u
的前驱
*
顶点
*/
void dfsSearch (Graph const &graph, int s, /*
输入
*/
vector<int> &pred) { /*
输出
*/
//
初始化
pred[]
数组，并将所有顶点标记为白色以表示未被访问过
const int n = graph.numVertices();
vector<vertexColor> color (n, White);
pred.assign(n, -1);
//
从源顶点开始搜索
dfsVisit (graph, s, pred, color);
}
6.2.4 算法分析
图中的每个顶点都会调用一次
dfsVisit
递归函数。在该函数中，每一个邻接顶点都要
被检查。对于有向图来说，每一条边都只会被遍历一次，然而在无向图中，它们会被遍
历一次然后再被检查一次。不管在哪种情况下，其性能费用都是
O
(
V
+
E
)
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.