I have a list of linkedlist.
List<LinkedList<File1>> lists =
Collections.synchronizedList(new ArrayList<LinkedList<File1>>());
each linkedlist contains objects of type File1.
class File1
{
int dist,nod;
}
Can anyone help me to sort the elements based on dist.
I thought of using collections.sort() but this cannot be used in this case, so can anyone suggest a better idea?
Iterate over each linkedlist in your arraylist, then sort it. But to make sure that the elements are sorted on dist, you should implement Comparable:
public class File1 implements Comparable<File1>
{
int dist, nod;
public int compareTo(File1 f)
{
return Integer.compare(dist, f.dist);
}
}
You could sort either the inner or outer lists using the Collections.sort() method that accepts a Comparator.
public static void sort(List list, Comparator c)
Use Collections.sort() with a custom comparator that compares the dist value of each object.
