compute the shortest paths between vertices More...

#include <plugin_shortest_paths.h>

Inherits analytic_engine_base, and query_base.

Public Member Functions
	REGISTER_QUERY_TYPE (analytic_engine_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 neighbor_map_index, string source_vertex_key, vertex_id_type source_vertex_id, string sink_vertex_key, vertex_id_type sink_vertex_id, bool reverse_direction)

void	get_shortest_paths (vertex_id_type source, vertex_id_type sink, vertex_to_set_map &id_to_predecessors, unordered_map< vertex_id_type, vector< path_type >> &paths)

void	get_shortest_paths (vertex_id_type source, vertex_id_type sink, shortest_paths_struct_type &shortest_paths_struct, unordered_map< vertex_id_type, vector< path_type >> &paths)

Detailed Description

compute the shortest paths between vertices

Member Function Documentation

int analytic_engine_shortest_paths::run ( struct query_param_type )

Parameters

–src	(optional) source (start) vertex ID; if not specified, paths from all vertices are computed
–sink	(optional) sink (end) vertex ID; if not specified, single-source shortest paths to all other vertices are computed
–in	(optional) use the cached result of a previous query as input (if it contains both vertices and edges, the computation will be restricted to the induced sub-graph; if it contains vertices only, the computation will be restricted to single-source shortest paths from these vertices in the whole 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: