Which data structure? Say you are running Dijkstra's algorithm on the fol- lowing types of graphs, where the edges have arbitrary non-negative weights and directions. For each, which data structure would give the best asymp- totic performance and what would that be in terms of n?