Faculty of Computer Science and Engineering

Department of Computer Science

Tut 8 - Graph
Cu 1:
Mt th c th dng biu din cc mi quan h (v d trong mng x hi).
T cc danh sch di y, hy v th biu din cc mi quan h ca nhng ngi lin quan.
People = {George, Jim, Jean, Frank, Fred, John, Susan}
Friendship = {(George, Jean), (Frank, Fred), (George, John), (Jim, Fred), (Jim, Frank), (Jim,
Susan), (Susan, Frank)}
T , tm:
a. Tt c bn ca John
b. Tt c bn ca Susan
c. Tt c bn ca bn ca Jean
d. Tt c bn ca bn ca Jim.

Cu 2:
Cho mt th nh hnh di y.

a. Hy cho bit mt th t topo ca th ny.

b. Hy b i ton b chiu ca ng i ( bin th trn thnh th v hng) ri tm cy
ph ti thiu ca th dng gii thut Prim.

Faculty of Computer Science and Engineering

Department of Computer Science

Cu 3:
Vit mt thut ton tm tt c chu trnh trong th c hng.
Cu 4:
Mt chu trnh Euler trong mt th l mt chu trnh m bt u t 1 nh, i qua tt c cc cnh
mt ln duy nht v quay tr li nh xut pht (cc nh c th c i qua nhiu ln). Vit mt
chng trnh kim tra mt th c cha chu trnh Euler hay khng.
Xem thm v chu trnh Euler: https://en.wikipedia.org/wiki/Eulerian_path