Associated values with HashMap

[Miles Runner]

Hello,
All this corresponds to a program that should provide the shortest path between two vertices of a weighted graph.
My structure is this:

private HashMap <Summit, trst <arc>> graph;

So I have a class that contains the Summit:

private String nm; 
	private int plusCourt; / / Evaluation Associate at Summit

And a class Arc:

private Summit arr;
	private int wg;

I created all vertices and all arcs. I entered the hashmap for each vertex the arcs involved. All this works wonderfully! Now I want to change the attribute plusCourt for all vertices contained in the hashmap.

for(S Summit: graph.keySet()){
						
			if(s.getName()== Departure)
			{
				sommetDepart = s;
s.setPlusCourt(0);
				
			}
			else
			{
				s.setPlusCourt(3255);	
			}
		}

And in fact, after running this code, as I travel all the keys to display the value, I have only null?!? Logically if I change a key it should keep its value in the associated hashmap? Thanks in advance.

[Windowed]

Hello,
Just have a look at the code below, this will describe a function and I think you are interested in this.

if(s.getName()== Departure)

No comparison == on strings. Your "null" where you have specifically?

[Logan 2]

Hello,
Even I am trying a code something like this. In fact I put this bit of code before and after treatment:

TreeSet <arc> t;
		for(S Summit: graph.keySet()){
					
					
			t = graph.get(s);
System.out.System.out.println(t);
		}

It appears that everything is correct before and after I display with null.

[Miles Runner]

Hey,
Here is my modified code, have a look and if I am wrong somewhere then you can correct me.

for(S Summit: lesKey){
			Summit tsm = s;
TreeSet <arc> tmpTree = graph.get(s);
			
			if(s.getName().equals(Departure))
			{
				sommetDepart = s;
s.setPlusCourt(0);
graph.remove(tsm);
graph.could(s, tmpTree);
				
			}
			else
			{
				s.setPlusCourt(3000);
graph.remove(tsm);
graph.could(s, tmpTree);
			}
		}

[SoftWore]

Hi,
Okay, you can add the following to your code and see how it is compiled.

HashMap <Summit, TreeSet <arc>> mtp = graph;
Set <VERTEX> lsky = mtp.keySet();

This is because AC reference the same objects in memory? You will have to create a new object again. Do, this and see if the program runs perfectly.

[Logan 2]

Hello,
Ok, I have modified my code and this is what I have with me now.

TreeSet <arc> t = graph.get(sommetDepart);	
		
		for(Arc: t){
			
			if(sommetDepart.getPlusCourt()+ a.getPoids()<a.getArrivee().getPlusCourt()){					
				a.getArrivee().splcrt(sommetDepart.getPlusCourt()+ a.getPoids());
			}
		}