[D:/Data/OpenSource/bart-master/src/misc/graph.c line 635
Code:
graph_t graph_bridge_node(graph_t graph, node_t node)
{
int N = node->N_vertices;
if ((2 != N) || (!node->io_flags[0]) || (node->io_flags[1]))
return NULL;
for (int i = 0; i < list_count(node->edges[0]); i++)
if ((vertices_get(node->edges[0], i))->node->external)
return false; // <-- maybe better: return NULL;
[D:/Data/OpenSource/bart-master/src/misc/graph.c line 635 Code: graph_t graph_bridge_node(graph_t graph, node_t node) { int N = node->N_vertices; if ((2 != N) || (!node->io_flags[0]) || (node->io_flags[1])) return NULL;