如果结果不匹配，请 
更多“如果支撑树T*的权w(T*)是G的所有支撑树权中最小的，则称…”相关的问题
图7中所示的无向图G中，实线边所表示的子图为G的一棵生成树T。
(1)求G对应T的所有基本回路。
(2)求G对应T的所有基本割集。
无向图G如图16.26所示，其中实线边为G的一棵生成树T。
(1)求G对应T的基本回路系统。
(2)求G对应T的基本割集系统。
试画出从空树开始，由字符序列(t，d，e，s，u，g，b，j，a，k，r，i)构成的二叉平衡树，并为每一次的平衡处理指明旋转类型。
A、前序
B、中序
C、后序
D、层次序
设
在空间C[0，1]中，这个问题解u(x，t)当
听力原文：W: Have you planned anything for the weekend？
M: Yes, and no. I'd really like to go on a trip, but I don't have any money. You can't travel for nothing, you know.
W: I don't want you to go away, Jahn. I don't feel like staying at school alone.
M: Well, in that case, I'll be with you.
what is the man going to do？
A．Stay at home
B．Go on a trip.
C．Make some money.
D．Stay with the woman.
听力原文：W: I'm afraid we are going to miss the 3 -o'clock train.
M: Don' t worry. We can get our tickets changed for this evening.
Q: What does the man suggest they should do？
(15)
A．Check the timetable.
B．Go to the railway station earlier.
C．Travel on a later train.
D．Cancel the trip earlier.
