Modify the main code and estimate the time complexity

Author: hcyuser

src/MSC_distance.java

@@ -6,9 +6,9 @@
 public class MSC_distance {
 	MSC_distance(ArrayList<User> input){
 		Set<User> set = new HashSet<User>(input);
-		see(set);
+		//see(set);
 		Set<User> OutputUser = main(set);
-		see(OutputUser);
+		//see(OutputUser);
 
 	}
 
@@ -34,6 +34,7 @@ public void see(User a) {
 		for(Integer aa: a.interest) {
 			System.out.print(aa+":");
 		}
+		System.out.println("#"+a.x+"::"+a.y+"#");
 		System.out.println("");
 	}
 	public void isee( Set<Integer> set ) {
@@ -47,16 +48,19 @@ public Set<User> main(Set<User> set) {
 		if(set.size()==0) {
 			return new HashSet<User>();
 		}
-
+		
 		set = DelSubUser(set);
-
+		
 		Set<User> unique = UniqueElement(set);
 		if( unique.size() > 0 ) {
 			set = delete( set, unique );
 			unique.addAll(main(set));
 			return unique;
 		}
-
+		
+		if(set.size()==0) {
+			return new HashSet<User>();
+		}
 		User label = ChooseMaxSizeUser(set);
 
 		if( label.interest.size()==2) {
@@ -73,7 +77,7 @@ public Set<User> main(Set<User> set) {
 		else
 			return CountDistance( a ) < CountDistance( b )? a : b;
 	}
-	
+
 	public double CountDistance(Set<User> InputUser) {
 		double max=0;
 		for(User a: InputUser) {
@@ -90,7 +94,17 @@ public double CountDistance(Set<User> InputUser) {
 
 	public Set<User> DelSubUser(Set<User> InputUser) {
 		Set<User> ForDelete = new HashSet<>();
-		for(User a: InputUser) {
+		User[] InList = InputUser.toArray(new User[InputUser.size()]);
+		
+		for( int i = 0; i < InList.length; ++i )
+			for( int j = i + 1; j < InList.length; ++j )
+			{
+				if( isSubSet( InList[ i ].interest, InList[ j ].interest ) )
+					ForDelete.add( InList[ j ] );
+				else if( isSubSet( InList[ j ].interest, InList[ i ].interest ) )
+					ForDelete.add( InList[ i ] );
+			}
+		/*for(User a: InputUser) {
 			for(User b: InputUser) {
 				if(isSubSet(a.interest,b.interest)&& !a.equals(b)) {
 					if(!ForDelete.contains(b)) {
@@ -99,7 +113,7 @@ public Set<User> DelSubUser(Set<User> InputUser) {
 					}
 				}
 			}
-		}
+		}*/
 		for(User del: ForDelete) {
 			InputUser.remove(del);
 		}
@@ -150,6 +164,9 @@ public Set<User> delete( Set<User> user, Set<User> uniq ) {
 				element.add( i );
 		for( User u: user ) {
 			User n = new User();
+			n.x = u.x;
+			n.y = u.y;
+			n.id = u.id;
 			for( Integer i: u.interest )
 				if( !element.contains( i ) )
 					n.interest.add( i );
@@ -161,10 +178,11 @@ public Set<User> delete( Set<User> user, Set<User> uniq ) {
 	}
 
 	public User ChooseMaxSizeUser(Set<User> InputUser) {
+		
 		User max = null;
 		int size=0;
 		for(User user: InputUser) {
-			if(user.interest.size()>size) {
+			if(user.interest.size()>=size) {
 				size = user.interest.size();
 				max = user;
 			}
@@ -181,8 +199,11 @@ public Set<User> Condition2msc(Set<User> InputUser) {
 			Integer[] arr = new Integer[a.interest.size()];
 			System.arraycopy(a.interest.toArray(), 0, arr, 0, a.interest.size()); 
 			g.addVertex(arr[0]);
-			g.addVertex(arr[1]);
-			g.addEdge(arr[0], arr[1]);
+			if(true||arr.length!=1) {
+				g.addVertex(arr[1]);
+				g.addEdge(arr[0], arr[1]);
+			}
+
 		}
 
 		MatchingImpl m = new MatchingImpl(g,g.edgeSet(),0);
@@ -223,4 +244,5 @@ public Set<User> Condition2msc(Set<User> InputUser) {
 		}
 		return OutputUser;
 	}
+	
 }

src/Main.java

@@ -1,59 +1,65 @@
+import java.io.FileWriter;
+import java.io.IOException;
 import java.util.ArrayList;
 import java.util.HashSet;
 import java.util.Set;
 
 public class Main {
-	public static void main(String[] args) {
-		double experiment = 0;
-		for(int  e=0;e<1;e++) {
-
-			int totalusers = 100;
-			int totalinterest = 50;
-			double xrange =  10;
-			double yrange =  10;
-			ArrayList<User> presentUser = new ArrayList<>();
-			for(int i=0;i<totalusers;i++) {
-				User instance = new User();
-				instance.x = (Math.random()*xrange);
-				instance.y = (Math.random()*yrange);
-				instance.id = i;
-				for(int ii=0;ii< (int)(Math.random()*totalinterest+1);ii++) {
-
-					instance.interest.add((int)(Math.random()*totalinterest+1));
-				}
-				presentUser.add(instance);
-				instance = null;
 
-			}
-			//show the result of random and the presentUser
-			for(int i=0;i<presentUser.size();i++) {
-				//System.out.println(i+" "+presentUser.get(i).x+" "+presentUser.get(i).y+" "+presentUser.get(i).interest.size());
+	public static void main(String[] args) throws IOException {
+		FileWriter fw = new FileWriter("output.txt");
+		int totalusers = 0;
+		for(int j=100;j<=1000;j=j+100) {
+			totalusers=j;
+			double experiment = 0;
+			for(int  e=0;e<100;e++) {
+				double partial = 0.5;
+				int totalinterest = (int) (totalusers *partial);
+				double xrange =  totalusers;
+				double yrange =  totalusers;
+				ArrayList<User> presentUser = new ArrayList<>();
+				for(int i=0;i<totalusers;i++) {
+					User instance = new User();
+					instance.x = (Math.random()*xrange);
+					instance.y = (Math.random()*yrange);
+					instance.id = i;
+					for(int ii=0;ii< (int)(Math.random()*totalinterest+1);ii++) {
+
+						instance.interest.add((int)(Math.random()*totalinterest+1));
+					}
+					presentUser.add(instance);
+					instance = null;
+
+				}
+				//show the result of random and the presentUser
+				/*for(int i=0;i<presentUser.size();i++) {
+				System.out.println(i+" "+presentUser.get(i).x+" "+presentUser.get(i).y+" "+presentUser.get(i).interest.size());
 
 
-			}
-			/*Greedy gr = new Greedy(new ArrayList<>(presentUser));
+			}*/
+				/*Greedy gr = new Greedy(new ArrayList<>(presentUser));
 			gr.countFar();
 			gr.findSetCover();*/
 
-			/*heuristicGreedy hgr = new heuristicGreedy(new ArrayList<>(presentUser));
+				/*heuristicGreedy hgr = new heuristicGreedy(new ArrayList<>(presentUser));
 			hgr.countFar();
 			hgr.findSetCover();*/
-			
-			/*GAR gar = new GAR(new ArrayList<>(presentUser));
+
+				/*GAR gar = new GAR(new ArrayList<>(presentUser));
 			gar.RandomChoose();
 			gar.countFar();
 			gar.findSetCover();*/
 
-			/*RAG rag = new RAG(new ArrayList<>(presentUser));
+				/*RAG rag = new RAG(new ArrayList<>(presentUser));
 			rag.countFar();
 			rag.findSetCover();
 			rag.RandomChoose();*/
 
-			/*Set<User> set = gr.getGoal();
+				/*Set<User> set = gr.getGoal();
 			set.retainAll(rag.getGoal());
 			System.out.println((double)set.size()/gr.getGoal().size());
 			experiment = experiment+(double)set.size()/gr.getGoal().size();*/
-			/*ArrayList<User> presentUser2 = new ArrayList<>();
+				/*ArrayList<User> presentUser2 = new ArrayList<>();
 			User t1 = new User();
 			t1.interest.add(1);
 			t1.interest.add(2);
@@ -72,13 +78,14 @@ public static void main(String[] args) {
 			presentUser2.add(t3);
 			presentUser2.add(t4);
 
-			MSC msc = new MSC(new ArrayList<>(presentUser2));*/
-			
+			MSC msc = new MSC(new ArrayList<>(presentUser2));
+
 			ArrayList<User> presentUser3 = new ArrayList<>();
 			User u1 = new User();
 			u1.interest.add(1);
-			u1.x = 0;
-			u1.y = 0;
+			//u1.interest.add(2);
+			u1.x = 5;
+			u1.y = 6;
 			User u2 = new User();
 			u2.interest.add(2);
 			u2.x = 0;
@@ -88,18 +95,23 @@ public static void main(String[] args) {
 			u3.x = 5;
 			u3.y = 6;
 			presentUser3.add(u1);
-			presentUser3.add(u2);
-			MSC_distance msc_distance = new MSC_distance(new ArrayList<>(presentUser3));
-	
-			
-			
+			presentUser3.add(u2);*/
 
-		}	
+				long time1 = System.currentTimeMillis();
+				MSC_distance msc_distance = new MSC_distance(new ArrayList<>(presentUser));
+				long time2 = System.currentTimeMillis();
+				experiment = experiment +(time2-time1);
+				//System.out.println((time2-time1) + "毫秒");
 
 
-		//System.out.println(" final "+experiment/100);
+			}	
 
 
+			//System.out.println(" final "+experiment/100);
+			System.out.println((experiment)/100 + "毫秒");
+			fw.write(totalusers+"\t"+(experiment)/100+"\r\n");
+			fw.flush();
+		}
 
 	}
 

src/User.java

@@ -13,6 +13,6 @@ public int hashCode() {
 		return n;
 	}
 	public boolean equals( User u ) {
-		return u.interest.equals( this.interest );
+		return u.interest.equals( this.interest ) && u.id==this.id;
 	}
 }