visit an adaptable priority queue supporting location-aware entries (section is used we insert vertex into with method insertwhich returns the location-aware entry of in we "attachto its entry in by means of method setentryand we retrieve the entry of by means of method getentry note that associating entries to the vertices is an instance of the decorator design pattern (section instead of using an additional data structure for the labels [ ]we exploit the fact that [uis the key of vertex in qand thus [ucan be retrieved given the entry for in changing the label of vertex to in the relaxation procedure corresponds to calling method replacekey( , )where is the location-aware entry for in