→ roud:87.... 08/01 11:49
→ Austin9:什麼意思？ 08/01 21:36
Using graph technique to find a circular arrangement of nine a's,nine b's
and nine c's such that each of the 27 words of length 3 from the alphabet
{a,b,c} appear exaclty once.
ans:
V={aa,ab,ac,ba,bb,bc,ca,cb,cc}
E={(t1t2,t2t3)|tiε{a,b,c},i=1,2,3}
for all vεV,id(v)=od(v)=3
G具有向的Euler circuit
aa->aa->ab->ba->ab->bb->bb->bc->cb->bc->cc->cc->cb->ba->aa->ac->cb->bb->
ba->ac->cc->ca->ac->ca->aa->bc->ca->aa
請問一下，有人怎麼知道怎麼跑出來的嗎？我怎麼試都試不出來說>_<
可以教一下嗎？謝謝。
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.64.207.179