@@ -253,12 +253,12 @@ MGPropertyGraphSchema MGPropertyGraphSchema::TransformToMaxGraph() {
253
253
MGPropertyGraphSchema new_schema;
254
254
std::set<std::string> prop_names;
255
255
for (const auto & entry : vertex_entries_) {
256
- for (const auto & prop : entry.props ) {
256
+ for (const auto & prop : entry.props_ ) {
257
257
prop_names.insert (prop.name );
258
258
}
259
259
}
260
260
for (const auto & entry : edge_entries_) {
261
- for (const auto & prop : entry.props ) {
261
+ for (const auto & prop : entry.props_ ) {
262
262
prop_names.insert (prop.name );
263
263
}
264
264
}
@@ -271,9 +271,9 @@ MGPropertyGraphSchema MGPropertyGraphSchema::TransformToMaxGraph() {
271
271
}
272
272
for (const auto & entry : vertex_entries_) {
273
273
Entry new_entry = entry;
274
- new_entry.mapping .resize (new_entry.props .size (), -1 );
274
+ new_entry.mapping .resize (new_entry.props_ .size (), -1 );
275
275
new_entry.reverse_mapping .resize (maximum_possible_mg_prop_id, -1 );
276
- for (auto & prop : new_entry.props ) {
276
+ for (auto & prop : new_entry.props_ ) {
277
277
int new_id = name_to_idx[prop.name ];
278
278
new_entry.mapping [prop.id ] = new_id;
279
279
new_entry.reverse_mapping [new_id] = prop.id ;
@@ -284,10 +284,10 @@ MGPropertyGraphSchema MGPropertyGraphSchema::TransformToMaxGraph() {
284
284
int vertex_label_num = vertex_entries_.size ();
285
285
for (const auto & entry : edge_entries_) {
286
286
Entry new_entry = entry;
287
- new_entry.mapping .resize (new_entry.props .size (), -1 );
287
+ new_entry.mapping .resize (new_entry.props_ .size (), -1 );
288
288
new_entry.reverse_mapping .resize (maximum_possible_mg_prop_id, -1 );
289
289
new_entry.id += vertex_label_num;
290
- for (auto & prop : new_entry.props ) {
290
+ for (auto & prop : new_entry.props_ ) {
291
291
int new_id = name_to_idx[prop.name ];
292
292
new_entry.mapping [prop.id ] = new_id;
293
293
new_entry.reverse_mapping [new_id] = prop.id ;
0 commit comments