Search:

Type: Posts; User: MiniatureBeast

Search: Search took 0.28 seconds.

  1. Replies
    2
    Views
    3

    Dijstra's Algorithm Problems

    Hey guys, So I'm trying write a dijstra's implementation in java. First off, here is the algorithm:

    package lab3;

    import java.util.HashMap;
    import java.util.Stack;

    /**
    * Compute shortest...
  2. Replies
    2
    Views
    3

    Dijstra's Algorithm Problems

    Hey guys, So I'm trying write a dijstra's implementation in java. First off, here is the algorith:

    package lab3;

    import java.util.HashMap;
    import java.util.Stack;

    /**
    * Compute shortest...
  3. Re: Priority Queue in Java which keeps track of each node's position

    Sure, here is the test that I'm failing:



    @Test
    public void basicHandleAndDecreaseTest() {
    PriorityQueue<String> q = new PriorityQueue<String>();
    Map<String, Handle>...
  4. Priority Queue in Java which keeps track of each node's position

    so I'm working on a lab for my class. I need to create a Priority Queue in Java using an array list. The kicker is that each node has to have a "handle" which is just an object which contains the...
  5. Re: How to make Java determine if a values is an integer or not.

    Thanks I'll look into this. Thanks to everyone else as well :)
  6. How to make Java determine if a values is an integer or not.

    In my code I'm trying to test if a value is an integer or not. If the entered value is an integer, than I let the user proceed; However, If it isn't the user must go back and enter a valid value. I...
Results 1 to 6 of 6