the shortest-path array an additional click of the path button will install table under the graphas you can see in figure the corresponding message is copied row from adjacency matrix to shortest-path array dijkstra' algorithm starts by copying the appropriate row of the adjacency matrix (that isthe row for the starting vertexto an array (remember that you can examine the adjacency matrix at any time by pressing the view button this array is called the "shortest-patharray it corresponds to the most recent row of notebook entries you made while determining the cheapest train fares in magnaguena this array will hold the current versions of the shortest paths to the other verticeswhich we can call the destination vertices these destination vertices are represented by the column heads in table table step the shortest-path array inf( (ainf( (ainf(ain the appletthe shortest-path figures in the array are followed by the parent vertex enclosed in parentheses the parent is the vertex you reached just before you reached the destination vertex in this case the parents are all because we've moved only one edge away from if fare is unknown (or meaninglessas from to )it' shown as infinityrepresented by "inf,as in the rail-fare notebook entries notice that the column heads of those vertices that have already been added to the tree are shown in red the entries for these columns won' change minimum distance initiallythe algorithm knows the distances from to other vertices that are exactly one edge from only and are adjacent to aso they're the only ones whose distances are shown the algorithm picks the minimum distance another click on path will show you the message minimum distance from is to vertex the algorithm adds this vertex to the treeso the next click will show you added vertex to tree now is circled in the graphand the column head is in red the edge from to is made darker to show it' also part of the tree