Repository navigation
Expand file tree
/
Copy pathgraphchi_program.hpp
More file actions
93 lines (73 loc) · 2.67 KB
/
Copy pathgraphchi_program.hpp
File metadata and controls
93 lines (73 loc) · 2.67 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
/**
* @file
* @author Aapo Kyrola <[email protected]>
* @version 1.0
*
* @section LICENSE
*
* Copyright [2012] [Aapo Kyrola, Guy Blelloch, Carlos Guestrin / Carnegie Mellon University]
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
* @section DESCRIPTION
*
* GraphChiProgram must be subclassed by GraphChi user programs.
* They can define an update function (run for each vertex), and
* call backs for iteration and interval beginning and ending.
*/
#ifndef GRAPHCHI_PROGRAM_DEF
#define GRAPHCHI_PROGRAM_DEF
#include "api/graph_objects.hpp"
#include "api/graphchi_context.hpp"
namespace graphchi {
template <typename VertexDataType_, typename EdgeDataType_,
typename vertex_t = graphchi_vertex<VertexDataType_, EdgeDataType_> >
class GraphChiProgram {
public:
typedef VertexDataType_ VertexDataType;
typedef EdgeDataType_ EdgeDataType;
virtual ~GraphChiProgram() {}
/**
* Called before an iteration starts.
*/
virtual void before_iteration(int iteration, graphchi_context &gcontext) {
}
/**
* Called after an iteration has finished.
*/
virtual void after_iteration(int iteration, graphchi_context &gcontext) {
}
/**
* Support for the new "rinse" method. An app can ask the vertices currently in
* memory be updated again before moving to new interval or iteration.
*/
virtual bool repeat_updates(graphchi_context &gcontext) {
return false;
}
/**
* Called before an execution interval is started.
*/
virtual void before_exec_interval(vid_t window_st, vid_t window_en, graphchi_context &gcontext) {
}
/**
* Called after an execution interval has finished.
*/
virtual void after_exec_interval(vid_t window_st, vid_t window_en, graphchi_context &gcontext) {
}
/**
* Update function.
*/
virtual void update(vertex_t &v, graphchi_context &gcontext) = 0;
};
}
#endif