6.1概述 6.2系统分析 6.3系统设计 6.4系统实施与维护

4.1概述 4.2文字处理软件Word2000 4.3电子表格 Excel2000 4.4电子演示文稿 PowerPoint2000 4.5 WPS Office 2003

3.1概述 3.2常用微机操作系统 3.3 Windows2000操作系统基本操作系统

2.1概述 2.2中央处理器CPU 2.3存储器 2.4总线与输入/输出接口电路 2.5输入/输出设备

Shortest paths Single-source shortest paths nonnegative edge weights Dijkstra's algorithm: O(E+ vlg n General

麻省理工学院：《算法导论》（英文版） Lecture 21 Prof charles e. leiserson

Disioint-set data structure (Union-Find) Problem: maintain a dynamic collection of pairwise-disjoint sets S=(S Each set S; has one element distinguished as the representative element, rep[sil lust support 3 operations

Negative-weight cycles Recall: If a graph G=(V, E) contains a negative weight cycle then some shortest paths may not exist

Paths in graphs Consider a digraph g=(v, E)with edge-weight function w:E→>R. The weight of path p=v1→ →>…→> vi is defined to be (D)=∑(n,1)

How large should a hash table be? Goal: Make the table as small as possible but large enough so that it wont overflow(or otherwise become inefficient Problem: what if we don 't know the proper size