Crazy_yiner

摘要： DescriptionHere’s a simple graph problem: Find the shortest pathfrom the top-middle vertex to the bottom-middle vertexin a given tri-graph. A tri-graph is an acyclic graph of(N ≥ 2) rows and exactly 3 columns. Unlike regulargraphs, the costs in a tri-graph are associated with thevertices rather than 阅读全文