Function stack_graphs::c::sg_path_arena_find_all_complete_paths

#[no_mangle]
pub extern "C" fn sg_path_arena_find_all_complete_paths(
    graph: *const sg_stack_graph, 
    paths: *mut sg_path_arena, 
    starting_node_count: usize, 
    starting_nodes: *const sg_node_handle, 
    path_list: *mut sg_path_list
)

Finds all complete paths reachable from a set of starting nodes, placing the result into the path_list output parameter. You must free the path list when you are done with it by calling sg_path_list_done.

This function will not return until all reachable paths have been processed, so graph must already contain a complete stack graph. If you have a very large stack graph stored in some other storage system, and want more control over lazily loading only the necessary pieces, then you should use sg_forward_path_stitcher.