find a shortest path (edge weight ignored) between vertices More...

#include <plugin_find_path.h>

Inherits analytic_engine_base, and query_base.

Public Member Functions
	REGISTER_QUERY_TYPE (analytic_engine_find_path)

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, size_t max_num_hops, string label)

void	get_find_path (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_find_path (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

find a shortest path (edge weight ignored) between vertices

Member Function Documentation

int analytic_engine_find_path::run ( struct query_param_type )

Parameters

–src	source (start) vertex ID
–sink	(optional) sink (end) vertex ID
–in	(optional) use the cached result of a previous query as input (the computation will be restricted to the induced sub-graph)
–label	(optional) the label that all edges on the path must have
–maxnumhops	(optional) the maximum number of hops on the path; if all paths between the source vertex and the sink vertex have lengths greater than this value, no path is returned

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