static int check_iden_kmerList ( STACK * stack1, STACK * stack2 )
{
KMER_PT * ite1, *ite2;
if ( !stack1->item_c || !stack2->item_c ) // one of them is empty
{ return 0; }
while ( ( ite1 = ( KMER_PT * ) stackPop ( stack1 ) ) != NULL && ( ite2 = ( KMER_PT * ) stackPop ( stack2 ) ) != NULL )
{
if ( !KmerEqual ( ite1->kmer, ite2->kmer ) )
{ return 0; }
}
if ( stack1->item_c || stack2->item_c ) // one of them is not empty
{ return 0; }
else
{ return 1; }
}
void swapedge()
{
unsigned int i;
ARC * arc, *bal_arc, *temp_arc;
int count_swap = 0, count_equal = 0;
for ( i = 1; i <= num_ed; ++i )
{
if ( edge_array[i].deleted || EdSameAsTwin ( i ) )
{ continue; }
if ( EdSmallerThanTwin ( i ) )
{
if ( KmerLarger ( vt_array[edge_array[i].from_vt].kmer, vt_array[edge_array[i + 1].from_vt].kmer ) )
{
count_swap++;
copyEdge ( i, num_ed + 1 + 1 );
copyEdge ( i + 1, num_ed + 1 );
copyEdge ( num_ed + 1, i );
copyEdge ( num_ed + 1 + 1, i + 1 );
edge_array[i].bal_edge = 2;
edge_array[i + 1].bal_edge = 0;
//take care of the arcs
arc = edge_array[i].arcs;
while ( arc )
{
arc->bal_arc->to_ed = i + 1;
arc = arc->next;
}
arc = edge_array[i + 1].arcs;
while ( arc )
{
arc->bal_arc->to_ed = i;
arc = arc->next;
}
}
else if ( KmerEqual ( vt_array[edge_array[i].from_vt].kmer, vt_array[edge_array[i + 1].from_vt].kmer ) )
{
int temp = EdgeEqual ( i, i + 1 );
if ( temp == 0 )
{
count_equal++;
edge_array[i].bal_edge = 1;
delete1Edge ( i + 1 );
//take care of the arcs
arc = edge_array[i].arcs;
while ( arc )
{
arc->bal_arc->to_ed = i;
arc = arc->next;
}
bal_arc = edge_array[i + 1].arcs;
edge_array[i + 1].arcs = NULL;
while ( bal_arc )
{
temp_arc = bal_arc;
bal_arc = bal_arc->next;
if ( edge_array[i].arcs )
{ edge_array[i].arcs->prev = temp_arc; }
temp_arc->next = edge_array[i].arcs;
edge_array[i].arcs = temp_arc;
}
}
else if ( temp > 0 )
{
count_swap++;
copyEdge ( i, num_ed + 1 + 1 );
copyEdge ( i + 1, num_ed + 1 );
copyEdge ( num_ed + 1, i );
copyEdge ( num_ed + 1 + 1, i + 1 );
edge_array[i].bal_edge = 2;
edge_array[i + 1].bal_edge = 0;
//take care of the arcs
arc = edge_array[i].arcs;
while ( arc )
{
arc->bal_arc->to_ed = i + 1;
arc = arc->next;
}
arc = edge_array[i + 1].arcs;
while ( arc )
{
arc->bal_arc->to_ed = i;
arc = arc->next;
}
}
}
++i;
}
else
{
delete1Edge ( i );
printf( "Warning : Front edge %d is larger than %d.\n", i, i + 1 );
}
}
printf( "%d none-palindrome edge(s) swapped, %d palindrome edge(s) processed.\n", count_swap, count_equal );
};