Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
10 changes: 5 additions & 5 deletions ext/priority_queue/CPriorityQueue/priority_queue.c
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@
*
* This is a fibonacci heap priority queue implementation.
*
* (c) 2005 Brian Schr�der
* (c) 2005 Brian Schröder
*
* Please submit bugreports to priority_queue@brian-schroeder.de
*
Expand Down Expand Up @@ -285,7 +285,7 @@ priority_node* priority_queue_delete_min(priority_queue* q) {
n = n->right;
} while (n!=min->child);

// Kinder einf�gen
// Kinder einfügen
if (q->rootlist) {
priority_node* const l1 = q->rootlist->left;
priority_node* const l2 = n->left;
Expand All @@ -299,10 +299,10 @@ priority_node* priority_queue_delete_min(priority_queue* q) {
}
}

// Gr��e anpassen
// Größe anpassen
q->length = length-1;

// Wieder aufh�bschen
// Wieder aufhübschen
consolidate_queue(q);
}

Expand Down Expand Up @@ -817,7 +817,7 @@ void pq_node2dot(VALUE result_string, priority_node* n, unsigned int level) {
pq_node2dot(result_string, n1, level + 1);
for (i=0; i<level; i++) rb_str_cat2(result_string, " ");
rb_str_concat(result_string,
rb_funcall(Qnil, id_format, 4, rb_str_new2("NODE%i -> NODE%i;\n"),
rb_funcall(Qnil, id_format, 3, rb_str_new2("NODE%i -> NODE%i;\n"),
ULONG2NUM((unsigned long) n), ULONG2NUM((unsigned long) n1)));
n1 = n1->right;
} while(n1 != n->child);
Expand Down
2 changes: 1 addition & 1 deletion lib/priority_queue/version.rb
Original file line number Diff line number Diff line change
@@ -1,3 +1,3 @@
module PriorityQueue
VERSION = "0.1.6"
VERSION = "0.1.7"
end