| author | J. Ali Harlow <ali@juiblex.co.uk> |
| Thu May 14 05:50:37 2009 +0100 (2009-05-14) | |
| changeset 365 | b7e2d327239a |
| parent 364 | 66ec30bde5e5 |
| child 366 | f176b2ba3cb3 |
1.1 --- a/librazor/types/graph.c Sat May 09 21:30:22 2009 +0100 1.2 +++ b/librazor/types/graph.c Thu May 14 05:50:37 2009 +0100 1.3 @@ -376,8 +376,8 @@ 1.4 return L; 1.5 } 1.6 1.7 -/* Use deque_pop for conventional ordering (A->B->C) 1.8 - * and deque_shift for the reverse. 1.9 +/* Use deque_shift for conventional ordering (A->B->C) 1.10 + * and deque_pop for the reverse. 1.11 */ 1.12 struct deque *graph_sort(struct graph *graph) 1.13 {