第三章无穷级数习题课 一、小结。 二、展开: 1e在z=0泰勒展开,预期结果:a2,z1(z=1为奇)

3.5单值函数的孤立奇点 1函数的奇点 孤立奇点:若z-b<内除b外f(x)别无其他奇点则z=b是f(z)的孤立奇点

3.3泰勒级数 一、泰勒定理

一、复数项级数 1级数定义 2敛散定义 3研究方法 4收敛的充要条件

2.3 Cauchy公式 一、 Cauchy公式: 1.单通区域的 Cauchy公式设l一区域σ边界围线

flow networks Definition. A flow network is a directed graph G=(, E)with two distinguished vertices:a source s and a sink t. Each edge(u, v)E E has a nonnegative capacity c(u, v). If(u, v) E, then c(u, v)=0 Example: c 2001 by 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

Graphs(review) Definition. a directed graph(digraph G=(, E)is an ordered pair consisting of a set y of vertices(singular: vertex) a sete c× of edges. In an undirected graphG=(V, E), the edge set e consists of unordered pairs of vertices In either case, we have El=O(v2).Moreover if G is connected, then E2v-l, which

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