Messages posted by: sara12345

static void Reordering_solution(){
	    for (int y=0; y<vector_SA.size()-1; y++){
	      not_visited.clear();
	      boolean flag=false;
	      nex_min_sw_same_dir(vect_ordered_temp,next_point);
	     if (vect_min.size()==1){
	       test_after_filling_ordering.add(vect_min.get(0).toString());
	       _2nd_min_element=vect_min.get(0).toString();
	       vect_ordered_temp.removeElement(next_point);
	       next_point=_2nd_min_element; }// end if condition
		   
	      if (vect_min.size()>1){
		 for (int k=0;k<vect_min.size();k++){
		    vect_min_s= vect_min.get(k).toString();
		    if (first_vect_min!=null && vect_min_s.equals(first_vect_min)){
		      for (int m=k+1;m< vect_min.size();m++)
			not_visited.add(vect_min.get(m).toString());}
		     if (first_vect_min==null ){
		       not_visited.add(vect_min.get(k).toString());}
                      }
		      if (not_visited.size()==0){
			y=vector_SA.size()-1;
			vect_min_s= null;}
			        
		     if (not_visited.size()!=0){
		      vect_min_s=not_visited.get(0).toString();

if (not_visited.size()==vect_min.size()){
			if (total_3.size()>not_visited.size() ){
			  for (int i=0; i< total_3.size();i++){
			     if (total_3.get(i).toString().equals(not_visited.get(0).toString()) && total_3.get(i+1).toString().equals(not_visited.get(1).toString())){
			        flag=true;
			        y=vector_SA.size(); }}  }
			        
				   
			   if (flag==false){
			  for (int h=0; h<not_visited.size();h++){
			  for (int g = 0; g < test_after_filling_ordering.size(); g++) {
				   total_1.add(test_after_filling_ordering.get(g).toString());}
			       total_1.add( "Empty");
			       total_1.add(not_visited.get(h).toString());
			       total_1.add( "Empty");
	 		  for (int g = 0; g < vect_ordered_temp.size(); g++) {
	 			total_1.add(vect_ordered_temp.get(g).toString());} 
	 		    total_1.add("Empty"); }}}
			   
			   if (flag==false){
		               
			 
		   	test_after_filling_ordering.add(vect_min_s);
			 _2nd_min_element=vect_min_s;
		         vect_ordered_temp.removeElement(next_point);
		         next_point=_2nd_min_element;}}}
		    
 
	   if ( test_after_filling_ordering.size()==vector_SA.size()){
		   y=vector_SA.size()-1;
	  
		 System.out.println(" The Reordering string is :  ");
		 System.out.println(test_after_filling_ordering);}}  
		
		
	   test_after_filling_ordering.clear();
	   vect_ordered_temp.clear();
	   copy_min.clear();
	   test_pattern1.clear();
	   test_pattern2.clear();
	   test_pattern3.clear();
	   
	   
	    if(total_1.size()==0)
	    	return;
	    
	    for (int j=0; j< total_1.size();j++){
	    	 if (!total_1.get(j).toString().equals("Empty") && total_1.get(j).toString()!=null){
	    	    test_pattern1.add(total_1.get(j).toString());}
	    	 if (total_1.get(j).toString().equals("Empty")){
	    	     stop=j;
	    	     j=total_1.size();} }
	    	  
	    	
	       stop++;

test_pattern2.add(total_1.get(stop).toString());
			
	       stop++;
		     
		total_3.add(test_pattern2);
		   
		
		 stop++;

for (int j=stop; j< total_1.size();j++){
	    	   if (!total_1.get(j).toString().equals("Empty") && total_1.get(j).toString()!=null){
	    	    test_pattern3.add(total_1.get(j).toString());}
	    	   if (total_1.get(j).toString().equals("Empty")){
	    	      stop_2=j;
	    	      j=total_1.size();} }

if(total_1.size()==stop_2+1)
		   return;

for (int j=stop_2+1; j< total_1.size();j++){
	    	   if (!total_1.get(j).toString().equals("Empty")){
	    	    test_after_filling_ordering.add(total_1.get(j).toString());}
	    	    if (total_1.get(j).toString().equals("Empty")){
	    	      stop_3=j;
	    	      j=total_1.size();} }
			
			
	    
	 	 stop_3++;
			
	 	copy_min.add(total_1.get(stop_3).toString());

stop_3++;
			
		
		   
		 stop_3++;

for (int j=stop_3; j< total_1.size();j++){
	    	    if (!total_1.get(j).toString().equals("Empty")){
	    	      vect_ordered_temp.add(total_1.get(j).toString());}
	    	       if (total_1.get(j).toString().equals("Empty")){
	    		   stop_4=j;
	    		   j=total_1.size();} }
		   
		  
		  total_2.clear();
		   
		  stop_4++;
		 
		   
		 for (int j=stop_4; j< total_1.size();j++){
	    	   total_2.add(total_1.get(j).toString());}
		  
                     
		   total_1.clear();
			 
			  
		 for (int g = 0; g < test_after_filling_ordering.size(); g++) {
		   total_1.add(test_after_filling_ordering.get(g).toString());}

total_1.add("Empty");
		  total_1.add(copy_min.get(0).toString());
		  total_1.add("Empty");

for (int g = 0; g < vect_ordered_temp.size(); g++) {
		    total_1.add(vect_ordered_temp.get(g).toString());}
		    total_1.add("Empty");

if (total_2.size()!=0){
		    for (int j=0; j< total_2.size();j++){
		     total_1.add(total_2.get(j).toString());}}
		
              
			    	   
		   next_point=test_after_filling_ordering.get(test_after_filling_ordering.size()-1).toString();
			
		   if (test_pattern1.equals(test_after_filling_ordering)){
		    first_vect_min=test_pattern2.get((test_pattern2.size()-1)).toString();}
		   if (!test_pattern1.equals(test_after_filling_ordering))
		    first_vect_min=null;

Reordering_solution();
}

the code shown above
thanks

hello
I'm facing error "stack over flow" when obtaining results of recursion fuction
I have tested the recursion fuction on medium data size and it works fine and the results are correct but for large data it prints some of the results then an error said "stackOverflowError" is occurd

I need to complete the results of this large data is there is away to do that

thanks alot

hello
I need to write data to array of files but I have an error

can you tell me what is the problem with the array of files

thanks

Hello
I want to implement greedy algorithm for solving travelling salesman problem and really I face problem in implementing this in java I want to find all suboptimal solutions I mean if two cities(a, b) have the same distance the first suboptimal must take city a and from city a taking the next near city and the second optimal solution is taking city b and then taking near city to b and so on

I have tried for about 3 days and I really feel upset

I have made the solution that just take one solution and ignore the remaining but really I want to find all optimal solutions

I really need your advice how to do it

thanks alot

hello everyone
-I have problem in finding all possible solutions for reordering of vector.

-I have vector named (vect_temp) and I want to find all possible reordering of this vector.

-I have function named Min_diff(vect_temp,next_point) works as follows : I should gave it an element (next_point) in the vector (vect_temp) and it must generate the vector (vect_diff) that contains all possible elements next elements.

-The function nex_min(vect_temp,next_point) works as follows : I should gave it an element (next_point) in the vector (vect_temp) and it must generate the vector (vect_min) that contains all possible elements next elements.

-reordering critriea:
-Min_diff(vect_temp,next_point) and nex_min(vect_temp,next_point) and (next_point) in this first iteration is equal to any selected element in the (vect_temp). after calling the functions, if element in the (vect_diff) is equal to the element in ( vect_min) then add this element into the ordered set [ vec_ordering] and call functions Min_diff(vect_temp,next_point) and nex_min(vect_temp,next_point) again , next_point now is the equal to the element that we have been added in the previous step into the ordered set [ vec_ordering] and repeat this process until all elements in (vect_temp) are ordered according to this criteria.

- I'm able to do reordering according to the cirtira above and find one solution. but the problem is that if (vect_diff) contains many elements that equal to many elements in ( vect_min), in this case I need to do reordering for the first equal element and this will be one solution and then find reordering for the next equal element and so on.

let's consider this example:
- let (vect_temp) contains element [5,9,7,3,1]
- for the firs iteration let the next_point equal to 7
- after calling function Min_diff(vect_temp,next_point), then (vect_diff) will contain [ 5,9,3]
- after calling function nex_min(vect_temp,next_point), then ( vect_min) will contain [ 5,9]
so for now (vect_diff) and ( vect_min) will have two equal elements.
- the first solution must be that fist take the first equal element and do reordering such that ordered set [ vec_ordering] will equal to [7,5] then call functions Min_diff(vect_temp,next_point), and nex_min(vect_temp,next_point) again. the( next_point) in this iteration is qual to 5, these funtions will find next elements, let's consider that (vect_diff) and ( vect_min) will have equal element [3] then add this element to the ordered set [ vec_ordering] and repeat calling functions util all elments in (vect_temp) are added to the ordered set [ vec_ordering]. This will be one solution. now the second solution will be is to take second equal elment [9] instead of [5] and continue calling functions and finding ordered list.
so that each time vect_diff and vect_min will have many equal elements, then do reordering for first equal element this is one solution and then do reordering for the second equal element and so on.

-my code that can only find one solution that takes only first equal element in (vect_diff) and ( vect_min) and continue ordering is below

I hope that someone can answer me how to find all posssible reordering set it is urgent pleasssssse

thanks alot that's work fine

thanks for the code but I need to use it for a vector I have change the code as the following:

but after this change I have noticed that it appends all elements of vector together
for example if the vector [1,2,3] I have got 123,321........
can you tell me what is wrong please
thanks

hello
I need to find all possible order of a set of vector I mean if I have the following:
0
1
2
all posssible would be:
0 1 2, 1 0 2, 2 1 0, 1 2 0, 2 0 1, 0 2 1

I have tried to use the swap but I didn't get all possible set
I have used the following code:

Code:
for( int x=0;x<vector.size();x++) {
for ( int w=0;w< vector.size();w++){
Collections.swap(vector, x, w);}}

as I said before the swap method didn't provide me the result I want
can somebody tell me how to do it please urgent

ok if you mean that how can I run my c code in command prompt
I have run it like that
c:\Users\sara\Desktop\sara\sara\cpp.exe

ok I'm just compile the c code using visual c++ 6.0 and after I have compile it, the exe file will be saved somewhere and just in java code Ihave to call c code in that path??
is this what you mean??

ok now no error but still the command line doesnt' appear I have warning said the ( returnValue) is never read!

when I put the command you gave it to me in the main method an error message said "Un handleled exeption type" should I put it somewhere else

thanks

sorry that's because the code you gave it to me very long! so where should I call the c code I mean if the c code named cp1.c where should I call it in java code??
thanks and sorry for these questions

ok thanks alot the errors are removed

but where should I call the exe file should I use the code below:

ok I don't have 1.6 compiler compliance I only have 1.3, 1.4 ,5 ,6 ???