| 71 | |
| 72 | |
| 73 | void topological_sort( int * * graph, int num_vertices, int * result ) |
| 74 | { |
| 75 | int i; |
| 76 | int * colors = ( int * )BJAM_CALLOC( num_vertices, sizeof( int ) ); |
| 77 | for ( i = 0; i < num_vertices; ++i ) |
| 78 | colors[ i ] = white; |
| 79 | |
| 80 | for ( i = 0; i < num_vertices; ++i ) |
| 81 | if ( colors[ i ] == white ) |
| 82 | do_ts( graph, i, colors, &result ); |
| 83 | |
| 84 | BJAM_FREE( colors ); |
| 85 | } |
| 86 | |
| 87 | |
| 88 | LIST * order( FRAME * frame, int flags ) |