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.
144
｜
第
6
章
decreaseKey
）在最坏情况下花费的时间为
O
(log
q
)
，其中
q
是二叉堆中顶点的数目，并
且
q
永远小于或者等于顶点总数
V
。
例
6-3
：
Dijkstra
算法实现
/**
给定一个有向带权图，计算到所有顶点的最短路径，
*
以及前驱链接
*/
void singleSourceShortest(Graph const &g, int s, /*
输入
*/
vector<int> &dist, /*
输出
*/
vector<int> &pred) { /*
输出
*/
//
初始化
dist[]
和
pred[]
数组。从顶点
s
开始，将
dist[]
值设为
0
//
优先队列
PQ
包含
G
中的所有顶点
v
const int n = g.numVertices();
pred.assign(n, -1);
dist.assign(n, numeric_limits<int>::max());
dist[s] = 0;
BinaryHeap pq(n);
for (int u = 0; u < n; u++) { pq.insert (u, dist[u]); }
//
在
V-S
中寻找
dist
最小的顶点
//
重新计算潜在的新路径，并更新所有最短路径
while (!pq.isEmpty()) {
int u = pq.smallest(); ...
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.