Convert (nodelist,edgelist) graph into explicit adjacency structure. Assume graph is directed. */
| 172 | Assume graph is directed. |
| 173 | */ |
| 174 | void mk_adjacency_graph(Graph g) |
| 175 | { |
| 176 | Edge e; |
| 177 | assert(g->directed); |
| 178 | for (e = g->edges; e; e = e->next) { |
| 179 | Node from = node_find(g, e->between[0]); |
| 180 | Node to = node_find(g, e->between[1]); |
| 181 | assert(from); |
| 182 | assert(to); |
| 183 | adj_edge_add(from, e, to); |
| 184 | } |
| 185 | } |
| 186 | |
| 187 | /** Get input file as one long string in global input. |
| 188 | Returns number of bytes read. |
no test coverage detected