Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 3429376
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 18, 20262026-05-18T07:04:26+00:00 2026-05-18T07:04:26+00:00

public static void Dijk(HashMap<String, HashMap<String, Integer>> map, String go, String stop){ PriorityQueue pq =

  • 0
public static void Dijk(HashMap<String, HashMap<String, Integer>> map, String go, String stop){
   PriorityQueue pq = new PriorityQueue();
    for (String x: map){

    }

  }

Why is the complier telling me I can’t use a foreach loop here?

Also this is smaller section of a large program but I haven’t had much experience with priority queues I want to use it to hold a <String, int> //or Integer am I doing this right? (Im using the PQ as a binary heap essentially) (this method will be implementing Dijkstra’s algorithm)

Thank you for your help/answers in advance!

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-18T07:04:26+00:00Added an answer on May 18, 2026 at 7:04 am

    Assuming you intend to iterate over the keys of the HashMap, you should try

    for (String x: map.keySet()){
    
    }
    

    As for the priority queue, take a look at the Java collection PriorityQueue

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

public static void main(String[] args) { List<? extends Object> mylist = new ArrayList<Object>(); mylist.add(Java);
public class WrapperTest { public static void main(String[] args) { Integer i = 100;
If I make a JFrame like this public static void main(String[] args) { new
public static void main(String [] a) { String s = new String(Hai); String s1=s;
public static void parseProfilesJson(String the_json){ try { JSONObject myjson = new JSONObject(the_json); JSONArray nameArray
public static void ShowNoResultFoundGridWiew<T>(List<T> source, GridView gv, string text) where T : new() {
public static void main(String[] args) { Map<String, Map<Long, List<String>>> map = getHashMap(); } static
public class XXX { public static void main(String args[]) { JComponent comp = new
public class Test { public static void main(String[] args) { } } class Outer
public class doublePrecision { public static void main(String[] args) { double total = 0;

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.