chapter 9 GRAPH ALGORITHMs $I Definitions e G(V,E) where G: =graph, V=V(G): :=finite nonempty set of vertices, andE=E(G): : = finite set of edges. d' Undirected graph:(V;,vi)=(j,vi): =the same edge 6 Directed graph(digraph): :=2* I tailhead
void tsmatr ix Add( TSMatrix A, TSMatr ix B, TSMatr ix&C)//三元组 表示的稀疏矩阵加法 C. mu=A. mu: C nu=A. nu C tu=0 pa=1;pb=1;pc=1; for(x=1;x<=A.mu;x+)//对矩阵的每一行进行加法 while(A data lpal. i
1、解: (1) P{只订购 A 的}=P{A(B∪C)}=P(A)-{P(AB)+P(AC)-P(ABC)}=0.45-0.1.-0.08+0.03=0.30. (2) P{只订购 A 及 B 的}=P{AB}-C}=P(AB)-P(ABC)=0.10-0.03=0.07 (3) P{只订购 A 的}=0.30