MCPcopy Create free account
hub / github.com/ElementsProject/lightning / node_adjacency_next

Function node_adjacency_next

plugins/askrene/child/graph.h:132–137  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

130 return arc.idx == INVALID_INDEX;
131}
132static inline struct arc node_adjacency_next(const struct graph *graph,
133 const struct arc arc)
134{
135 assert(arc.idx < graph_max_num_arcs(graph));
136 return graph->node_adjacency_next[arc.idx];
137}
138
139/* Used to loop over the arcs that enter a node. */
140static inline struct arc node_rev_adjacency_begin(const struct graph *graph,

Callers 9

BFS_pathFunction · 0.70
dijkstra_pathFunction · 0.70
node_balanceFunction · 0.70
dijkstra_nearest_sinkFunction · 0.70
get_flow_pathsFunction · 0.70
node_rev_adjacency_nextFunction · 0.70
showFunction · 0.50
showFunction · 0.50
showFunction · 0.50

Calls 1

graph_max_num_arcsFunction · 0.85

Tested by 3

showFunction · 0.40
showFunction · 0.40
showFunction · 0.40