compute the top k shortest paths between a source vertex and a sink vertex More...

#include <plugin_k_shortest_paths.h>

Inherits analytic_engine_base, and query_base.

Public Member Functions
	REGISTER_QUERY_TYPE (analytic_engine_k_shortest_paths)

int	run (struct query_param_type)

void	options (command_options &opts)

Private Member Functions
void	compute (struct query_param_type param, size_t k, string source_vertex_key, vertex_id_type source_vertex_id, string sink_vertex_key, vertex_id_type sink_vertex_id)

Detailed Description

compute the top k shortest paths between a source vertex and a sink vertex

Member Function Documentation

int analytic_engine_k_shortest_paths::run ( struct query_param_type )

Parameters

–src	source (start) vertex ID
–sink	sink (end) vertex ID
–k	k for k shortest paths
–in	(optional) use the cached result of a previous query as input (the computation will be restricted to the induced sub-graph)
–ignoreedgeweight	(optional) ignore edge weight when computing shortest paths
–hidepath	(optional flag) do not output detailed paths

The documentation for this class was generated from the following file: