sort-in-topological-order: use prio-queue

[~andy/git] / prio-queue.h

diff --git a/prio-queue.h b/prio-queue.h
index c766abec3de172b351ad2b43f4f20b6d9c63beee..9c3cd1f875ce553c2c10645c9b7df6b4287306f8 100644 (file)
--- a/prio-queue.h
+++ b/prio-queue.h
@@ -42,4 +42,7 @@ extern void *prio_queue_get(struct prio_queue *);
 
 extern void clear_prio_queue(struct prio_queue *);
 
+/* Reverse the LIFO elements */
+extern void prio_queue_reverse(struct prio_queue *);
+
 #endif /* PRIO_QUEUE_H */