~eliavbuc/html/all__distance__sketch_8h_source.html

 #ifndef ALL_DISTANCE_SKETCH_ALL_DISTANCE_H_

 #define ALL_DISTANCE_SKETCH_ALL_DISTANCE_H_


 // Graph

 #include "graph/graph.h"

 #include "graph/snap_graph_adaptor.h"


 // Algorithms

 #include "algorithms/dijkstra_shortest_paths.h"

 #include "algorithms/reverse_rank.h"

 #include "algorithms/sketch_calculation.h"

 #include "algorithms/t_skim.h"

 #include "algorithms/t_skim_reverse_rank.h"

 #include "algorithms/t_skim_dijkstra.h"


 // Sketch

 #include "sketch/node_sketch.h"

 #include "sketch/graph_sketch.h"


 #endif

dijkstra_shortest_paths.h
Optimized version of Dijkstra algorithm for the sketch calculation algorithm.

t_skim.h
Contains all TSkim influence maximization algorithms.

reverse_rank.h
Contains all reverse rank algorithms.

graph.h
Graph class.

t_skim_reverse_rank.h
Contains all TSkim influence maximization algorithms.

sketch_calculation.h
Sketch calculation algorithms.