| 337 | |
| 338 | @staticmethod |
| 339 | def _construct_graphs(node_dict, edge_dict): |
| 340 | graph_dict = {} |
| 341 | for graph_id in node_dict: |
| 342 | if graph_id not in edge_dict: |
| 343 | edge_dict[graph_id][("_V", "_E", "_V")] = {"edges": ([], [])} |
| 344 | graph = dgl_heterograph( |
| 345 | { |
| 346 | etype: edata["edges"] |
| 347 | for etype, edata in edge_dict[graph_id].items() |
| 348 | }, |
| 349 | num_nodes_dict={ |
| 350 | ntype: len(ndata["mapping"]) |
| 351 | for ntype, ndata in node_dict[graph_id].items() |
| 352 | }, |
| 353 | ) |
| 354 | |
| 355 | def assign_data(type, src_data, dst_data): |
| 356 | for key, value in src_data.items(): |
| 357 | dst_data[type].data[key] = value |
| 358 | |
| 359 | for type, data in node_dict[graph_id].items(): |
| 360 | assign_data(type, data["data"], graph.nodes) |
| 361 | for (type), data in edge_dict[graph_id].items(): |
| 362 | assign_data(type, data["data"], graph.edges) |
| 363 | graph_dict[graph_id] = graph |
| 364 | return graph_dict |
| 365 | |
| 366 | |
| 367 | class DefaultDataParser: |