-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathGraphContainer.cpp
More file actions
50 lines (44 loc) · 1.66 KB
/
GraphContainer.cpp
File metadata and controls
50 lines (44 loc) · 1.66 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
//===- GraphContainer.cpp -------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
//
// This file implements the Graph container descriptor.
//
//===----------------------------------------------------------------------===//
#ifndef GRAPH_CONTAINER_DEF
#define GRAPH_CONTAINER_DEF
#include </home/andros/GraphMLIR/include/Interface/Container.h>
#include </home/andros/GraphMLIR/include/Interface/GraphContainer.h>
// Adjaceny Matrix constructor.
template <typename T, size_t N> Graph<T, N>::Graph(T V, T **adjMatrix) : MemRef<T, N>() {
this->size[0] = V;
this->size[1] = V;
this->strides[0] = V;
this->strides[1] = V;
this->allocated = new T[this->size];
//TODO
// Add the implementation for passing data to alignned.
this->aligned = this->allocated;
int k = 0;
for (int i = 0; i < size[0]; i++) {
for (int j = 0; j < size[1]; j++) {
this->aligned[k] = (T)adjMatrix[i][j];
k++;
}
}
};
// TODO
// Implement the contructor for different implementation.
#endif // GRAPH_CONTAINER_DEF