Advertisement
Guest User

Untitled

a guest
May 25th, 2015
257
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.08 KB | None | 0 0
  1. public ArrayList<Integer> topN(Integer N) {
  2. // PRE: none
  3. // POST: returns N vertices with highest number of visits, in order;
  4. // returns all vertices if <N in the graph;
  5. // returns vertices ranked 1,..,N,N+1,..,N+k if these k have the
  6. // same number of visits as vertex N
  7.  
  8. //create a linked list that goes through the list and finds highest value adds to list and marks it then goes though again etc etc
  9. // TODO
  10. ArrayList<Integer> tn = new ArrayList<Integer>(N);
  11. //TreeSet<Integer> ts = new TreeSet<Integer>(vertexSet());
  12. //Iterator<Integer> it = ts.iterator();
  13. Integer Vertex = null;
  14. int listLength = 0;
  15. while (listLength < N){
  16. Integer high = 0;
  17. for(int i = 0; i<=vertexSet().size(); i++){
  18. Vertex = i;
  19. if(isMarked(high) == true) //if 0 is highest value adds 1 to keep loop running
  20. high = high++;
  21. else{
  22. if(getVisits(Vertex) > getVisits(high) && isMarked(Vertex) != true){
  23. high = i;
  24. }
  25. }
  26. }
  27. tn.add(listLength, high);
  28. setMarked(high);
  29. listLength++;
  30.  
  31. }
  32. return tn;
  33. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement