binomial_node* pq_find_min( binomial_queue *queue )
{
if ( pq_empty( queue ) )
return NULL;
return queue->minimum;
}
void kruskal()
{
int i, e;
pq_init();
find_init();
//1. 모든 정점을 pq삽입한다.
// 우선순위 큐가 가중치가 가장 낮은 것이 루트가 되도록 정렬
for (i = 0; i < E; i++)
pq_insert(i);
while (!pq_empty())
{
e = pq_remove();
//2. 분리집합인지 확인한다.
// edge[e]의 양쪽 정점이 같은 집합에 속해 있는지 확인 한 후
// 같은 집합이 아니면 최소 신장 트리에 추가
// 집합을 합친다.
if (find_set(edge[e].v1, edge[e].v2))
{
printf("%c %c\n", int2name(edge[e].v1), int2name(edge[e].v2));
cost += edge[e].weight;
}
}
printf("최소비용 : %d\n", cost);
}
key_type pq_delete_min( strict_fibonacci_heap *queue )
{
if( pq_empty( queue ) )
return 0;
key_type key = queue->root->key;
strict_fibonacci_node *current, *new_root, *old_root;
int i, j;
old_root = queue->root;
if( old_root->left_child == NULL )
{
old_root = queue->root;
if( is_active( queue, old_root ) )
convert_to_passive( queue, old_root );
queue->root = NULL;
}
else
{
new_root = select_new_root( queue );
remove_from_siblings( queue, new_root );
dequeue_node( queue, new_root );
queue->root = new_root;
if( is_active( queue, new_root ) )
convert_to_passive( queue, new_root );
if( is_active( queue, old_root ) )
convert_to_passive( queue, old_root );
while( old_root->left_child != NULL )
link( queue, new_root, old_root->left_child );
for( i = 0; i < 2; i++ )
{
current = consume_node( queue );
if( current != NULL )
{
for( j = 0; j < 2; j++ )
{
if( current->left_child != NULL &&
!is_active( queue, current->left_child->left ) )
link( queue, new_root, current->left_child->left );
else
break;
}
}
}
}
pq_free_node( queue->map, STRICT_NODE_FIB, old_root );
post_delete_min_reduction( queue );
garbage_collection( queue );
queue->size--;
return key;
}
int main(int argc, char *argv[])
{
pq_init(5);
assert(pq_empty());
pq_insert(1);
pq_insert(2);
pq_insert(3);
pq_insert(4);
pq_insert(5);
pq_show(); nl();
int i;
for (i = 0; i < 5; i++)
{
pq_delmax();
pq_show(); nl();
}
return 0;
}
int main(void)
{
int n = 5;
pq_t pq = pq_init(n);
int i;
for (i = 0; i < n; i++) {
int item = rand() % 100;
printf("%3d ", item);
pq_insert(pq, item);
}
putchar('\n');
/*pq_print(pq);*/
while (!pq_empty(pq)) {
printf("%3d ", pq_delmax(pq));
}
putchar('\n');
pq_finalize(&pq);
return 0;
}
implicit_node* pq_find_min( implicit_heap *queue )
{
if ( pq_empty( queue ) )
return NULL;
return queue->nodes[0];
}
fibonacci_node* pq_find_min( fibonacci_heap *queue )
{
if ( pq_empty( queue ) )
return NULL;
return queue->minimum;
}
int main( int argc, char** argv )
{
uint64_t i;
// pointers for casting
pq_op_create *op_create;
pq_op_destroy *op_destroy;
pq_op_clear *op_clear;
pq_op_get_key *op_get_key;
pq_op_get_item *op_get_item;
pq_op_get_size *op_get_size;
pq_op_insert *op_insert;
pq_op_find_min *op_find_min;
pq_op_delete *op_delete;
pq_op_delete_min *op_delete_min;
pq_op_decrease_key *op_decrease_key;
//pq_op_meld *op_meld;
pq_op_empty *op_empty;
// temp dummies for readability
pq_type *q;//, *r;
pq_node_type *n;
if( argc < 2 )
exit( -1 );
int trace_file = open( argv[1], O_RDONLY );
if( trace_file < 0 )
{
fprintf( stderr, "Could not open file.\n" );
return -1;
}
pq_trace_header header;
pq_trace_read_header( trace_file, &header );
close( trace_file );
//printf("Header: (%llu,%lu,%lu)\n",header.op_count,header.pq_ids,
// header.node_ids);
pq_op_blank *ops = calloc( MIN( header.op_count, CHUNK_SIZE ),
sizeof( pq_op_blank ) );
pq_type **pq_index = calloc( header.pq_ids, sizeof( pq_type* ) );
pq_node_type **node_index = calloc( header.node_ids,
sizeof( pq_node_type* ) );
if( ops == NULL || pq_index == NULL || node_index == NULL )
{
fprintf( stderr, "Calloc fail.\n" );
return -1;
}
#ifdef USE_QUAKE
mem_capacities[0] = header.node_ids << 2;
#else
mem_capacities[0] = header.node_ids;
#endif
#ifdef USE_EAGER
mem_map *map = mm_create( mem_types, mem_sizes, mem_capacities );
#else
mem_map *map = mm_create( mem_types, mem_sizes );
#endif
uint64_t op_remaining, op_chunk;
int status;
struct timeval t0, t1;
uint32_t iterations = 0;
uint32_t total_time = 0;
key_type k;
//pq_node_type *min;
#ifndef CACHEGRIND
while( iterations < 5 || total_time < PQ_MIN_USEC )
{
mm_clear( map );
iterations++;
#endif
trace_file = open( argv[1], O_RDONLY );
if( trace_file < 0 )
{
fprintf( stderr, "Could not open file.\n" );
return -1;
}
pq_trace_read_header( trace_file, &header );
op_remaining = header.op_count;
while( op_remaining > 0 )
{
op_chunk = MIN( CHUNK_SIZE, op_remaining );
op_remaining -= op_chunk;
for( i = 0; i < op_chunk; i++ )
{
status = pq_trace_read_op( trace_file, ops + i );
if( status == -1 )
{
fprintf( stderr, "Invalid operation!" );
return -1;
}
}
#ifndef CACHEGRIND
gettimeofday(&t0, NULL);
#endif
for( i = 0; i < op_chunk; i++ )
{
switch( ops[i].code )
{
case PQ_OP_CREATE:
op_create = (pq_op_create*) ( ops + i );
//printf("pq_create(%d)\n", op_create->pq_id);
pq_index[op_create->pq_id] = pq_create( map );
break;
case PQ_OP_DESTROY:
op_destroy = (pq_op_destroy*) ( ops + i );
//printf("pq_destroy(%d)\n", op_destroy->pq_id);
q = pq_index[op_destroy->pq_id];
pq_destroy( q );
pq_index[op_destroy->pq_id] = NULL;
break;
case PQ_OP_CLEAR:
op_clear = (pq_op_clear*) ( ops + i );
//printf("pq_clear(%d)\n", op_clear->pq_id );
q = pq_index[op_clear->pq_id];
pq_clear( q );
break;
case PQ_OP_GET_KEY:
op_get_key = (pq_op_get_key*) ( ops + i );
//printf("pq_get_key(%d,%d)\n", op_get_key->pq_id,
// op_get_key->node_id );
q = pq_index[op_get_key->pq_id];
n = node_index[op_get_key->node_id];
pq_get_key( q, n );
break;
case PQ_OP_GET_ITEM:
op_get_item = (pq_op_get_item*) ( ops + i );
//printf("pq_get_item(%d,%d)\n", op_get_item->pq_id,
// op_get_item->node_id);
q = pq_index[op_get_item->pq_id];
n = node_index[op_get_item->node_id];
pq_get_item( q, n );
break;
case PQ_OP_GET_SIZE:
op_get_size = (pq_op_get_size*) ( ops + i );
//printf("pq_get_size(%d)\n", op_get_size->pq_id);
q = pq_index[op_get_size->pq_id];
pq_get_size( q );
break;
case PQ_OP_INSERT:
op_insert = (pq_op_insert*) ( ops + i );
//printf("pq_insert(%d,%d,%llu,%d)\n", op_insert->pq_id,
// op_insert->node_id, op_insert->key, op_insert->item );
q = pq_index[op_insert->pq_id];
node_index[op_insert->node_id] = pq_insert( q,
op_insert->item, op_insert->key );
break;
case PQ_OP_FIND_MIN:
op_find_min = (pq_op_find_min*) ( ops + i );
//printf("pq_find_min(%d)\n", op_find_min->pq_id );
q = pq_index[op_find_min->pq_id];
pq_find_min( q );
break;
case PQ_OP_DELETE:
op_delete = (pq_op_delete*) ( ops + i );
//printf("pq_delete(%d,%d)\n", op_delete->pq_id,
// op_delete->node_id );
q = pq_index[op_delete->pq_id];
n = node_index[op_delete->node_id];
pq_delete( q, n );
break;
case PQ_OP_DELETE_MIN:
op_delete_min = (pq_op_delete_min*) ( ops + i );
//printf("pq_delete_min(%d)\n", op_delete_min->pq_id);
q = pq_index[op_delete_min->pq_id];
//min = pq_find_min( q );
k = pq_delete_min( q );
#ifdef CACHEGRIND
if( argc > 2 )
printf("%llu\n",k);
#endif
break;
case PQ_OP_DECREASE_KEY:
op_decrease_key = (pq_op_decrease_key*) ( ops + i );
//printf("pq_decrease_key(%d,%d,%llu)\n", op_decrease_key->pq_id,
// op_decrease_key->node_id, op_decrease_key->key);
q = pq_index[op_decrease_key->pq_id];
n = node_index[op_decrease_key->node_id];
pq_decrease_key( q, n, op_decrease_key->key );
break;
/*case PQ_OP_MELD:
printf("Meld.\n");
op_meld = (pq_op_meld*) ( ops + i );
q = pq_index[op_meld->pq_src1_id];
r = pq_index[op_meld->pq_src2_id];
pq_index[op_meld->pq_dst_id] = pq_meld( q, r );
break;*/
case PQ_OP_EMPTY:
op_empty = (pq_op_empty*) ( ops + i );
//printf("pq_empty(%d)\n", op_empty->pq_id);
q = pq_index[op_empty->pq_id];
pq_empty( q );
break;
default:
break;
}
//verify_queue( pq_index[0], header.node_ids );
}
#ifndef CACHEGRIND
gettimeofday(&t1, NULL);
total_time += (t1.tv_sec - t0.tv_sec) * 1000000 +
(t1.tv_usec - t0.tv_usec);
#endif
}
close( trace_file );
#ifndef CACHEGRIND
}
#endif
for( i = 0; i < header.pq_ids; i++ )
{
if( pq_index[i] != NULL )
pq_destroy( pq_index[i] );
}
mm_destroy( map );
free( pq_index );
free( node_index );
free( ops );
#ifndef CACHEGRIND
printf( "%d\n", total_time / iterations );
#endif
return 0;
}
strict_fibonacci_node* pq_find_min( strict_fibonacci_heap *queue )
{
if ( pq_empty( queue ) )
return NULL;
return queue->root;
}
