All Distance Sketch  0.1
All distance sketch based algorithms
Namespaces | Typedefs | Functions
reverse_rank.h File Reference

Contains all reverse rank algorithms. More...

#include "../common.h"
#include "../sketch/graph_sketch.h"
#include "../proto/ranking.pb.h"

Go to the source code of this file.

Namespaces

 all_distance_sketch
 

Typedefs

typedef proto::NodeRanksGpb all_distance_sketch::NodeRanksGpb
 
typedef proto::NodeRankGpb all_distance_sketch::NodeRankGpb
 

Functions

template<class T >
static void all_distance_sketch::CalculateReverseRank (int source, graph::Graph< T > *graph, GraphSketch *graph_sketch, std::vector< int > *ranking)
 Calculates the reverse ranks of a single node. More...
 
template<class T , class CallBacks >
static void all_distance_sketch::CalculateReverseRank (int source, graph::Graph< T > *graph, GraphSketch *graph_sketch, std::vector< int > *ranking, CallBacks *call_backs)
 Calculates the reverse ranks of a single node. More...
 
static void all_distance_sketch::SaveRankingToGpb (int source_node_id, const std::vector< int > &ranking, NodeRanksGpb *node_ranks)
 saves the ranking to Gpb
 
static void all_distance_sketch::LoadRankingFromGpb (std::vector< int > *ranking, const NodeRanksGpb &node_ranks)
 

Detailed Description

Contains all reverse rank algorithms.