| 158 | } |
| 159 | |
| 160 | static void adj_edge_add(Node from, Edge e, Node to) |
| 161 | { |
| 162 | e->from = from; |
| 163 | e->to = to; |
| 164 | if (from->last_out) |
| 165 | from->last_out->next_adj_out = e; |
| 166 | else |
| 167 | from->outgoing = e; |
| 168 | from->last_out = e; |
| 169 | } |
| 170 | |
| 171 | /** Convert (nodelist,edgelist) graph into explicit adjacency structure. |
| 172 | Assume graph is directed. |
no outgoing calls
no test coverage detected