1、Fiber Network的解（100）O(v+e) O(n3) BFS 最快（O(v2+ve)Fiber Network的解（100）O(v+e) O(n3) BFS 最快（O(v2+ve) 根本不用進行26次判斷，僅僅需要1次計算就and，or BFS 為對于不同的圖，BFS的運算順序是不一樣的。DijkstraFloyd-Warshall 把每條邊上的字母用數字表示（a=20 ，b=21 ，c=22 ，等等然后進行 dataij dataijordataikand讓為1k的結的子圖中i能通向j，1k-1 1k-1 FiberTimelimit:1Memorylimit:Several s

2、tartup companies have decided to build a ernet, called the FiberNet. have alreadyTimelimit:1Memorylimit:Several startup companies have decided to build a ernet, called the FiberNet. have already installed many t routers all around the world. y, started to quarrel about the connecting lines, andended

3、 up with everycompany laying its own of cablesnsomeofthe Now, service providers, who want to send data from node A to node B are curious, company is able to provide the sary connections. Help the providers by answering The ontainsseveraltestcases.Eachtestcasestartswiththenumbernodesofthenetworkn.Inp

4、utisterminatedbyn=0.Otherwise,1=n=Nodeshavethenumbers1,.,n.Thenfollows alistofconnections.connectionstartswithtwonumbersA,B.ThelistofconnectionsisterminatedA=B=0.Otherwise,1=A,B=n,andtheydenotethestartoftheunidirectionalconnection,respectively.Foreveryconnection,theB.Acompanyisidentifiedbyalower-caseletter.Thesetofcompanieshavingconnectionisjustawordedof lower-caseAfterthelistofconnections,eachtestcaseiscompletedbyalistofqueries.byA =B =0.Otherwise,1=A,B =n,andtheydenotethe startandidenticalstartandidenticalstartandendnodeofthequery.Iftherearenocompanies,output-Outp