fig09_30.cpp

来自「数据结构与算法设计－C/C++描述两本书的所有示例程序标准代码。」· C++ 代码 · 共 14 行

/**
 * Print shortest path to v after dijkstra has run.
 * Assume that the path exists.
 */
void Graph::printPath( Vertex v )
{
    if( v.path != NOT_A_VERTEX )
    {
        printPath( v.path );
        cout << " to ";
    }
    cout << v;
}