edge_disjoint_paths_many_to_many_driver.cpp File Reference

#include <sstream>
#include <vector>
#include <set>
#include "./pgr_edgedisjointpaths.hpp"
#include "./edge_disjoint_paths_many_to_many_driver.h"
#include "../../common/src/pgr_alloc.hpp"
#include "./../../common/src/pgr_types.h"

Go to the source code of this file.

Functions
void	do_pgr_edge_disjoint_paths_many_to_many (pgr_basic_edge_t *data_edges, size_t total_tuples, int64_t *source_vertices, size_t size_source_verticesArr, int64_t *sink_vertices, size_t size_sink_verticesArr, bool directed, General_path_element_t **return_tuples, size_t *return_count, char **err_msg)

Function Documentation

void do_pgr_edge_disjoint_paths_many_to_many	(	pgr_basic_edge_t *	data_edges,
		size_t	total_tuples,
		int64_t *	source_vertices,
		size_t	size_source_verticesArr,
		int64_t *	sink_vertices,
		size_t	size_sink_verticesArr,
		bool	directed,
		General_path_element_t **	return_tuples,
		size_t *	return_count,
		char **	err_msg
	)

Definition at line 50 of file edge_disjoint_paths_many_to_many_driver.cpp.

References PgrEdgeDisjointPathsGraph< G >::boykov_kolmogorov(), PgrEdgeDisjointPathsGraph< G >::create_edge_disjoint_paths_graph(), PgrEdgeDisjointPathsGraph< G >::get_edge_disjoint_paths(), and pgr_alloc().

Referenced by process().