Win a copy of Think Java: How to Think Like a Computer Scientist this week in the Java in General forum!
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic

prims algorithm

 
ernest mcdermott
Greenhorn
Posts: 28
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
hi every1, im currently trying to do a very basic implementation of prims algorithm.
At present i have an array of nodes (places) and edges (distances between the places) all within the form of an adjacency matrix.
Iv now started Prims algorithm and i am trying to call the first node with the follwoing lines of code, altho it compiles and runs it doesnt do anything. Can any1 please help. Thanks in advance.

String firstnode(String[] nodes){
System.out.print(nodes[n=0]);
return nodes[n=0];
}
 
ernest mcdermott
Greenhorn
Posts: 28
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
sorry guys, meant to say that what i want is to return that node so that from ther i can work on to compare the edges away from it.
Thanks
 
Joanne Neal
Rancher
Posts: 3742
16
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
That code should print out the value of the first String in the array (although you don't need the 'n=' bit, nodes[0] will be fine). Have you actually put any Strings into the array ?
 
ernest mcdermott
Greenhorn
Posts: 28
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
thanks joanne, it was a foolish mistake on my behalf, got it sorted.
Thanks for your help
 
  • Post Reply
  • Bookmark Topic Watch Topic
  • New Topic