using the workshop applet let' see how this looks using the graphdw (for directed and weightedworkshop applet use the applet to create the graph from figure the result should look something like figure (we'll see how to make the table appear below the graph in moment this is weighteddirected graphso to make an edgeyou must type number before draggingand you must drag in the correct directionfrom the start to the destination figure the railroad scenario in graphdw when the graph is completeclick the path buttonand when promptedclick the vertex few more clicks on path will place in the treeshown with red circle around the shortest-path array an additional click will install table under the graphas you can see in figure the corresponding message near the top of the figure 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 the table table step the shortest-path array inf( (ainf( (ainf(