unit_graph.cc 52.6 KB
Newer Older
1
2
/*!
 *  Copyright (c) 2019 by Contributors
Minjie Wang's avatar
Minjie Wang committed
3
4
 * \file graph/unit_graph.cc
 * \brief UnitGraph graph implementation
5
6
 */
#include <dgl/array.h>
7
#include <dgl/base_heterograph.h>
8
9
#include <dgl/immutable_graph.h>
#include <dgl/lazy.h>
10
11

#include "../c_api_common.h"
12
#include "./unit_graph.h"
13
14

namespace dgl {
15

16
namespace {
17
18
19

using namespace dgl::aten;

Minjie Wang's avatar
Minjie Wang committed
20
21
22
23
24
25
26
27
28
29
// create metagraph of one node type
inline GraphPtr CreateUnitGraphMetaGraph1() {
  // a self-loop edge 0->0
  std::vector<int64_t> row_vec(1, 0);
  std::vector<int64_t> col_vec(1, 0);
  IdArray row = aten::VecToIdArray(row_vec);
  IdArray col = aten::VecToIdArray(col_vec);
  GraphPtr g = ImmutableGraph::CreateFromCOO(1, row, col);
  return g;
}
30

Minjie Wang's avatar
Minjie Wang committed
31
32
33
34
35
// create metagraph of two node types
inline GraphPtr CreateUnitGraphMetaGraph2() {
  // an edge 0->1
  std::vector<int64_t> row_vec(1, 0);
  std::vector<int64_t> col_vec(1, 1);
36
37
38
39
40
  IdArray row = aten::VecToIdArray(row_vec);
  IdArray col = aten::VecToIdArray(col_vec);
  GraphPtr g = ImmutableGraph::CreateFromCOO(2, row, col);
  return g;
}
Minjie Wang's avatar
Minjie Wang committed
41
42
43
44
45
46
47
48
49
50
51
52

inline GraphPtr CreateUnitGraphMetaGraph(int num_vtypes) {
  static GraphPtr mg1 = CreateUnitGraphMetaGraph1();
  static GraphPtr mg2 = CreateUnitGraphMetaGraph2();
  if (num_vtypes == 1)
    return mg1;
  else if (num_vtypes == 2)
    return mg2;
  else
    LOG(FATAL) << "Invalid number of vertex types. Must be 1 or 2.";
  return {};
}
53
54

};  // namespace
55
56
57
58
59
60
61

//////////////////////////////////////////////////////////
//
// COO graph implementation
//
//////////////////////////////////////////////////////////

Minjie Wang's avatar
Minjie Wang committed
62
class UnitGraph::COO : public BaseHeteroGraph {
63
 public:
Minjie Wang's avatar
Minjie Wang committed
64
65
  COO(GraphPtr metagraph, int64_t num_src, int64_t num_dst, IdArray src, IdArray dst)
    : BaseHeteroGraph(metagraph) {
66
67
68
    CHECK(aten::IsValidIdArray(src));
    CHECK(aten::IsValidIdArray(dst));
    CHECK_EQ(src->shape[0], dst->shape[0]) << "Input arrays should have the same length.";
69
70
    adj_ = aten::COOMatrix{num_src, num_dst, src, dst};
  }
71

72
73
74
75
  COO(GraphPtr metagraph, const aten::COOMatrix& coo)
    : BaseHeteroGraph(metagraph), adj_(coo) {
    // Data index should not be inherited. Edges in COO format are always
    // assigned ids from 0 to num_edges - 1.
76
    CHECK(!COOHasData(coo)) << "[BUG] COO should not contain data.";
77
    adj_.data = aten::NullArray();
78
  }
79

80
81
82
83
84
85
86
87
88
89
90
  COO() {
    // set magic num_rows/num_cols to mark it as undefined
    // adj_.num_rows == 0 and adj_.num_cols == 0 means empty UnitGraph which is supported
    adj_.num_rows = -1;
    adj_.num_cols = -1;
  };

  bool defined() const {
    return (adj_.num_rows >= 0) && (adj_.num_cols >= 0);
  }

Minjie Wang's avatar
Minjie Wang committed
91
92
  inline dgl_type_t SrcType() const {
    return 0;
93
  }
Minjie Wang's avatar
Minjie Wang committed
94
95
96
97
98
99
100

  inline dgl_type_t DstType() const {
    return NumVertexTypes() == 1? 0 : 1;
  }

  inline dgl_type_t EdgeType() const {
    return 0;
101
102
103
  }

  HeteroGraphPtr GetRelationGraph(dgl_type_t etype) const override {
Minjie Wang's avatar
Minjie Wang committed
104
    LOG(FATAL) << "The method shouldn't be called for UnitGraph graph. "
105
106
107
108
109
      << "The relation graph is simply this graph itself.";
    return {};
  }

  void AddVertices(dgl_type_t vtype, uint64_t num_vertices) override {
Minjie Wang's avatar
Minjie Wang committed
110
    LOG(FATAL) << "UnitGraph graph is not mutable.";
111
112
113
  }

  void AddEdge(dgl_type_t etype, dgl_id_t src, dgl_id_t dst) override {
Minjie Wang's avatar
Minjie Wang committed
114
    LOG(FATAL) << "UnitGraph graph is not mutable.";
115
116
117
  }

  void AddEdges(dgl_type_t etype, IdArray src_ids, IdArray dst_ids) override {
Minjie Wang's avatar
Minjie Wang committed
118
    LOG(FATAL) << "UnitGraph graph is not mutable.";
119
120
121
  }

  void Clear() override {
Minjie Wang's avatar
Minjie Wang committed
122
    LOG(FATAL) << "UnitGraph graph is not mutable.";
123
124
  }

125
126
127
128
  DLDataType DataType() const override {
    return adj_.row->dtype;
  }

129
130
131
132
133
134
135
136
  DLContext Context() const override {
    return adj_.row->ctx;
  }

  uint8_t NumBits() const override {
    return adj_.row->dtype.bits;
  }

137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
  COO AsNumBits(uint8_t bits) const {
    if (NumBits() == bits)
      return *this;

    COO ret(
        meta_graph_,
        adj_.num_rows, adj_.num_cols,
        aten::AsNumBits(adj_.row, bits),
        aten::AsNumBits(adj_.col, bits));
    return ret;
  }

  COO CopyTo(const DLContext& ctx) const {
    if (Context() == ctx)
      return *this;
152
    return COO(meta_graph_, adj_.CopyTo(ctx));
153
154
  }

155
  bool IsMultigraph() const override {
156
    return aten::COOHasDuplicate(adj_);
157
158
159
160
161
162
163
  }

  bool IsReadonly() const override {
    return true;
  }

  uint64_t NumVertices(dgl_type_t vtype) const override {
Minjie Wang's avatar
Minjie Wang committed
164
    if (vtype == SrcType()) {
165
      return adj_.num_rows;
Minjie Wang's avatar
Minjie Wang committed
166
    } else if (vtype == DstType()) {
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
      return adj_.num_cols;
    } else {
      LOG(FATAL) << "Invalid vertex type: " << vtype;
      return 0;
    }
  }

  uint64_t NumEdges(dgl_type_t etype) const override {
    return adj_.row->shape[0];
  }

  bool HasVertex(dgl_type_t vtype, dgl_id_t vid) const override {
    return vid < NumVertices(vtype);
  }

  BoolArray HasVertices(dgl_type_t vtype, IdArray vids) const override {
    LOG(FATAL) << "Not enabled for COO graph";
    return {};
  }

  bool HasEdgeBetween(dgl_type_t etype, dgl_id_t src, dgl_id_t dst) const override {
188
189
190
    CHECK(HasVertex(SrcType(), src)) << "Invalid src vertex id: " << src;
    CHECK(HasVertex(DstType(), dst)) << "Invalid dst vertex id: " << dst;
    return aten::COOIsNonZero(adj_, src, dst);
191
192
193
  }

  BoolArray HasEdgesBetween(dgl_type_t etype, IdArray src_ids, IdArray dst_ids) const override {
194
195
196
    CHECK(aten::IsValidIdArray(src_ids)) << "Invalid vertex id array.";
    CHECK(aten::IsValidIdArray(dst_ids)) << "Invalid vertex id array.";
    return aten::COOIsNonZero(adj_, src_ids, dst_ids);
197
198
199
  }

  IdArray Predecessors(dgl_type_t etype, dgl_id_t dst) const override {
200
201
    CHECK(HasVertex(DstType(), dst)) << "Invalid dst vertex id: " << dst;
    return aten::COOGetRowDataAndIndices(aten::COOTranspose(adj_), dst).second;
202
203
204
  }

  IdArray Successors(dgl_type_t etype, dgl_id_t src) const override {
205
206
    CHECK(HasVertex(SrcType(), src)) << "Invalid src vertex id: " << src;
    return aten::COOGetRowDataAndIndices(adj_, src).second;
207
208
209
  }

  IdArray EdgeId(dgl_type_t etype, dgl_id_t src, dgl_id_t dst) const override {
210
211
    CHECK(HasVertex(SrcType(), src)) << "Invalid src vertex id: " << src;
    CHECK(HasVertex(DstType(), dst)) << "Invalid dst vertex id: " << dst;
212
    return aten::COOGetAllData(adj_, src, dst);
213
214
  }

215
  EdgeArray EdgeIdsAll(dgl_type_t etype, IdArray src, IdArray dst) const override {
216
217
218
219
    CHECK(aten::IsValidIdArray(src)) << "Invalid vertex id array.";
    CHECK(aten::IsValidIdArray(dst)) << "Invalid vertex id array.";
    const auto& arrs = aten::COOGetDataAndIndices(adj_, src, dst);
    return EdgeArray{arrs[0], arrs[1], arrs[2]};
220
221
  }

222
223
224
225
  IdArray EdgeIdsOne(dgl_type_t etype, IdArray src, IdArray dst) const override {
    return aten::COOGetData(adj_, src, dst);
  }

226
227
  std::pair<dgl_id_t, dgl_id_t> FindEdge(dgl_type_t etype, dgl_id_t eid) const override {
    CHECK(eid < NumEdges(etype)) << "Invalid edge id: " << eid;
228
229
    const dgl_id_t src = aten::IndexSelect<int64_t>(adj_.row, eid);
    const dgl_id_t dst = aten::IndexSelect<int64_t>(adj_.col, eid);
230
231
232
233
    return std::pair<dgl_id_t, dgl_id_t>(src, dst);
  }

  EdgeArray FindEdges(dgl_type_t etype, IdArray eids) const override {
234
    CHECK(aten::IsValidIdArray(eids)) << "Invalid edge id array";
235
236
237
238
239
240
    return EdgeArray{aten::IndexSelect(adj_.row, eids),
                     aten::IndexSelect(adj_.col, eids),
                     eids};
  }

  EdgeArray InEdges(dgl_type_t etype, dgl_id_t vid) const override {
241
242
243
244
245
    IdArray ret_src, ret_eid;
    std::tie(ret_eid, ret_src) = aten::COOGetRowDataAndIndices(
        aten::COOTranspose(adj_), vid);
    IdArray ret_dst = aten::Full(vid, ret_src->shape[0], NumBits(), ret_src->ctx);
    return EdgeArray{ret_src, ret_dst, ret_eid};
246
247
248
  }

  EdgeArray InEdges(dgl_type_t etype, IdArray vids) const override {
249
250
251
252
    CHECK(aten::IsValidIdArray(vids)) << "Invalid vertex id array.";
    auto coosubmat = aten::COOSliceRows(aten::COOTranspose(adj_), vids);
    auto row = aten::IndexSelect(vids, coosubmat.row);
    return EdgeArray{coosubmat.col, row, coosubmat.data};
253
254
255
  }

  EdgeArray OutEdges(dgl_type_t etype, dgl_id_t vid) const override {
256
257
258
259
    IdArray ret_dst, ret_eid;
    std::tie(ret_eid, ret_dst) = aten::COOGetRowDataAndIndices(adj_, vid);
    IdArray ret_src = aten::Full(vid, ret_dst->shape[0], NumBits(), ret_dst->ctx);
    return EdgeArray{ret_src, ret_dst, ret_eid};
260
261
262
  }

  EdgeArray OutEdges(dgl_type_t etype, IdArray vids) const override {
263
264
265
266
    CHECK(aten::IsValidIdArray(vids)) << "Invalid vertex id array.";
    auto coosubmat = aten::COOSliceRows(adj_, vids);
    auto row = aten::IndexSelect(vids, coosubmat.row);
    return EdgeArray{row, coosubmat.col, coosubmat.data};
267
268
269
270
271
272
273
274
275
276
277
  }

  EdgeArray Edges(dgl_type_t etype, const std::string &order = "") const override {
    CHECK(order.empty() || order == std::string("eid"))
      << "COO only support Edges of order \"eid\", but got \""
      << order << "\".";
    IdArray rst_eid = aten::Range(0, NumEdges(etype), NumBits(), Context());
    return EdgeArray{adj_.row, adj_.col, rst_eid};
  }

  uint64_t InDegree(dgl_type_t etype, dgl_id_t vid) const override {
278
279
    CHECK(HasVertex(DstType(), vid)) << "Invalid dst vertex id: " << vid;
    return aten::COOGetRowNNZ(aten::COOTranspose(adj_), vid);
280
281
282
  }

  DegreeArray InDegrees(dgl_type_t etype, IdArray vids) const override {
283
284
    CHECK(aten::IsValidIdArray(vids)) << "Invalid vertex id array.";
    return aten::COOGetRowNNZ(aten::COOTranspose(adj_), vids);
285
286
287
  }

  uint64_t OutDegree(dgl_type_t etype, dgl_id_t vid) const override {
288
289
    CHECK(HasVertex(SrcType(), vid)) << "Invalid src vertex id: " << vid;
    return aten::COOGetRowNNZ(adj_, vid);
290
291
292
  }

  DegreeArray OutDegrees(dgl_type_t etype, IdArray vids) const override {
293
294
    CHECK(aten::IsValidIdArray(vids)) << "Invalid vertex id array.";
    return aten::COOGetRowNNZ(adj_, vids);
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
  }

  DGLIdIters SuccVec(dgl_type_t etype, dgl_id_t vid) const override {
    LOG(INFO) << "Not enabled for COO graph.";
    return {};
  }

  DGLIdIters OutEdgeVec(dgl_type_t etype, dgl_id_t vid) const override {
    LOG(INFO) << "Not enabled for COO graph.";
    return {};
  }

  DGLIdIters PredVec(dgl_type_t etype, dgl_id_t vid) const override {
    LOG(INFO) << "Not enabled for COO graph.";
    return {};
  }

  DGLIdIters InEdgeVec(dgl_type_t etype, dgl_id_t vid) const override {
    LOG(INFO) << "Not enabled for COO graph.";
    return {};
  }

  std::vector<IdArray> GetAdj(
      dgl_type_t etype, bool transpose, const std::string &fmt) const override {
    CHECK(fmt == "coo") << "Not valid adj format request.";
    if (transpose) {
      return {aten::HStack(adj_.col, adj_.row)};
    } else {
      return {aten::HStack(adj_.row, adj_.col)};
    }
  }

327
328
329
330
331
332
333
334
335
336
337
338
339
340
  aten::COOMatrix GetCOOMatrix(dgl_type_t etype) const override {
    return adj_;
  }

  aten::CSRMatrix GetCSCMatrix(dgl_type_t etype) const override {
    LOG(FATAL) << "Not enabled for COO graph";
    return aten::CSRMatrix();
  }

  aten::CSRMatrix GetCSRMatrix(dgl_type_t etype) const override {
    LOG(FATAL) << "Not enabled for COO graph";
    return aten::CSRMatrix();
  }

341
  SparseFormat SelectFormat(dgl_type_t etype, dgl_format_code_t preferred_formats) const override {
342
    LOG(FATAL) << "Not enabled for COO graph";
343
    return SparseFormat::kCOO;
344
345
  }

346
  dgl_format_code_t GetAllowedFormats() const override {
347
    LOG(FATAL) << "Not enabled for COO graph";
348
    return 0;
349
350
  }

351
  dgl_format_code_t GetCreatedFormats() const override {
352
353
354
355
    LOG(FATAL) << "Not enabled for COO graph";
    return 0;
  }

356
  HeteroSubgraph VertexSubgraph(const std::vector<IdArray>& vids) const override {
357
358
359
360
361
362
363
364
365
366
367
368
    CHECK_EQ(vids.size(), NumVertexTypes()) << "Number of vertex types mismatch";
    auto srcvids = vids[SrcType()], dstvids = vids[DstType()];
    CHECK(aten::IsValidIdArray(srcvids)) << "Invalid vertex id array.";
    CHECK(aten::IsValidIdArray(dstvids)) << "Invalid vertex id array.";
    HeteroSubgraph subg;
    const auto& submat = aten::COOSliceMatrix(adj_, srcvids, dstvids);
    IdArray sub_eids = aten::Range(0, submat.data->shape[0], NumBits(), Context());
    subg.graph = std::make_shared<COO>(meta_graph(), submat.num_rows, submat.num_cols,
        submat.row, submat.col);
    subg.induced_vertices = vids;
    subg.induced_edges.emplace_back(submat.data);
    return subg;
369
370
371
372
373
374
375
376
377
378
379
380
381
382
  }

  HeteroSubgraph EdgeSubgraph(
      const std::vector<IdArray>& eids, bool preserve_nodes = false) const override {
    CHECK_EQ(eids.size(), 1) << "Edge type number mismatch.";
    HeteroSubgraph subg;
    if (!preserve_nodes) {
      IdArray new_src = aten::IndexSelect(adj_.row, eids[0]);
      IdArray new_dst = aten::IndexSelect(adj_.col, eids[0]);
      subg.induced_vertices.emplace_back(aten::Relabel_({new_src}));
      subg.induced_vertices.emplace_back(aten::Relabel_({new_dst}));
      const auto new_nsrc = subg.induced_vertices[0]->shape[0];
      const auto new_ndst = subg.induced_vertices[1]->shape[0];
      subg.graph = std::make_shared<COO>(
Minjie Wang's avatar
Minjie Wang committed
383
          meta_graph(), new_nsrc, new_ndst, new_src, new_dst);
384
385
386
387
      subg.induced_edges = eids;
    } else {
      IdArray new_src = aten::IndexSelect(adj_.row, eids[0]);
      IdArray new_dst = aten::IndexSelect(adj_.col, eids[0]);
Quan (Andy) Gan's avatar
Quan (Andy) Gan committed
388
389
390
391
      subg.induced_vertices.emplace_back(
          aten::Range(0, NumVertices(SrcType()), NumBits(), Context()));
      subg.induced_vertices.emplace_back(
          aten::Range(0, NumVertices(DstType()), NumBits(), Context()));
392
      subg.graph = std::make_shared<COO>(
Quan (Andy) Gan's avatar
Quan (Andy) Gan committed
393
          meta_graph(), NumVertices(SrcType()), NumVertices(DstType()), new_src, new_dst);
394
395
396
397
398
      subg.induced_edges = eids;
    }
    return subg;
  }

399
  HeteroGraphPtr GetGraphInFormat(dgl_format_code_t formats) const override {
400
401
402
403
    LOG(FATAL) << "Not enabled for COO graph.";
    return nullptr;
  }

404
405
406
407
  aten::COOMatrix adj() const {
    return adj_;
  }

408
409
410
411
412
413
414
415
416
  /*!
   * \brief Determines whether the graph is "hypersparse", i.e. having significantly more
   * nodes than edges.
   */
  bool IsHypersparse() const {
    return (NumVertices(SrcType()) / 8 > NumEdges(EdgeType())) &&
           (NumVertices(SrcType()) > 1000000);
  }

417
418
419
420
421
422
423
424
425
426
427
428
429
  bool Load(dmlc::Stream* fs) {
    auto meta_imgraph = Serializer::make_shared<ImmutableGraph>();
    CHECK(fs->Read(&meta_imgraph)) << "Invalid meta graph";
    meta_graph_ = meta_imgraph;
    CHECK(fs->Read(&adj_)) << "Invalid adj matrix";
    return true;
  }
  void Save(dmlc::Stream* fs) const {
    auto meta_graph_ptr = ImmutableGraph::ToImmutable(meta_graph());
    fs->Write(meta_graph_ptr);
    fs->Write(adj_);
  }

430
 private:
431
432
  friend class Serializer;

433
434
435
436
437
438
439
440
441
442
443
  /*! \brief internal adjacency matrix. Data array is empty */
  aten::COOMatrix adj_;
};

//////////////////////////////////////////////////////////
//
// CSR graph implementation
//
//////////////////////////////////////////////////////////

/*! \brief CSR graph */
Minjie Wang's avatar
Minjie Wang committed
444
class UnitGraph::CSR : public BaseHeteroGraph {
445
 public:
Minjie Wang's avatar
Minjie Wang committed
446
  CSR(GraphPtr metagraph, int64_t num_src, int64_t num_dst,
447
      IdArray indptr, IdArray indices, IdArray edge_ids)
Minjie Wang's avatar
Minjie Wang committed
448
    : BaseHeteroGraph(metagraph) {
449
450
451
452
453
    CHECK(aten::IsValidIdArray(indptr));
    CHECK(aten::IsValidIdArray(indices));
    CHECK(aten::IsValidIdArray(edge_ids));
    CHECK_EQ(indices->shape[0], edge_ids->shape[0])
      << "indices and edge id arrays should have the same length";
454

455
456
457
    adj_ = aten::CSRMatrix{num_src, num_dst, indptr, indices, edge_ids};
  }

458
  CSR(GraphPtr metagraph, const aten::CSRMatrix& csr)
Da Zheng's avatar
Da Zheng committed
459
460
    : BaseHeteroGraph(metagraph), adj_(csr) {
  }
461

462
463
464
465
466
467
468
469
470
471
472
  CSR() {
    // set magic num_rows/num_cols to mark it as undefined
    // adj_.num_rows == 0 and adj_.num_cols == 0 means empty UnitGraph which is supported
    adj_.num_rows = -1;
    adj_.num_cols = -1;
  };

  bool defined() const {
    return (adj_.num_rows >= 0) || (adj_.num_cols >= 0);
  }

Minjie Wang's avatar
Minjie Wang committed
473
474
  inline dgl_type_t SrcType() const {
    return 0;
475
  }
Minjie Wang's avatar
Minjie Wang committed
476
477
478
479
480
481
482

  inline dgl_type_t DstType() const {
    return NumVertexTypes() == 1? 0 : 1;
  }

  inline dgl_type_t EdgeType() const {
    return 0;
483
484
485
  }

  HeteroGraphPtr GetRelationGraph(dgl_type_t etype) const override {
Minjie Wang's avatar
Minjie Wang committed
486
    LOG(FATAL) << "The method shouldn't be called for UnitGraph graph. "
487
488
489
490
491
      << "The relation graph is simply this graph itself.";
    return {};
  }

  void AddVertices(dgl_type_t vtype, uint64_t num_vertices) override {
Minjie Wang's avatar
Minjie Wang committed
492
    LOG(FATAL) << "UnitGraph graph is not mutable.";
493
494
495
  }

  void AddEdge(dgl_type_t etype, dgl_id_t src, dgl_id_t dst) override {
Minjie Wang's avatar
Minjie Wang committed
496
    LOG(FATAL) << "UnitGraph graph is not mutable.";
497
498
499
  }

  void AddEdges(dgl_type_t etype, IdArray src_ids, IdArray dst_ids) override {
Minjie Wang's avatar
Minjie Wang committed
500
    LOG(FATAL) << "UnitGraph graph is not mutable.";
501
502
503
  }

  void Clear() override {
Minjie Wang's avatar
Minjie Wang committed
504
    LOG(FATAL) << "UnitGraph graph is not mutable.";
505
506
  }

507
508
509
510
  DLDataType DataType() const override {
    return adj_.indices->dtype;
  }

511
512
513
514
515
516
517
518
  DLContext Context() const override {
    return adj_.indices->ctx;
  }

  uint8_t NumBits() const override {
    return adj_.indices->dtype.bits;
  }

519
520
521
522
523
  CSR AsNumBits(uint8_t bits) const {
    if (NumBits() == bits) {
      return *this;
    } else {
      CSR ret(
Minjie Wang's avatar
Minjie Wang committed
524
          meta_graph_,
525
526
527
528
529
530
531
532
533
534
535
536
          adj_.num_rows, adj_.num_cols,
          aten::AsNumBits(adj_.indptr, bits),
          aten::AsNumBits(adj_.indices, bits),
          aten::AsNumBits(adj_.data, bits));
      return ret;
    }
  }

  CSR CopyTo(const DLContext& ctx) const {
    if (Context() == ctx) {
      return *this;
    } else {
537
      return CSR(meta_graph_, adj_.CopyTo(ctx));
538
539
540
    }
  }

541
  bool IsMultigraph() const override {
542
    return aten::CSRHasDuplicate(adj_);
543
544
545
546
547
548
549
  }

  bool IsReadonly() const override {
    return true;
  }

  uint64_t NumVertices(dgl_type_t vtype) const override {
Minjie Wang's avatar
Minjie Wang committed
550
    if (vtype == SrcType()) {
551
      return adj_.num_rows;
Minjie Wang's avatar
Minjie Wang committed
552
    } else if (vtype == DstType()) {
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
      return adj_.num_cols;
    } else {
      LOG(FATAL) << "Invalid vertex type: " << vtype;
      return 0;
    }
  }

  uint64_t NumEdges(dgl_type_t etype) const override {
    return adj_.indices->shape[0];
  }

  bool HasVertex(dgl_type_t vtype, dgl_id_t vid) const override {
    return vid < NumVertices(vtype);
  }

  BoolArray HasVertices(dgl_type_t vtype, IdArray vids) const override {
    LOG(FATAL) << "Not enabled for COO graph";
    return {};
  }

  bool HasEdgeBetween(dgl_type_t etype, dgl_id_t src, dgl_id_t dst) const override {
Minjie Wang's avatar
Minjie Wang committed
574
575
    CHECK(HasVertex(SrcType(), src)) << "Invalid src vertex id: " << src;
    CHECK(HasVertex(DstType(), dst)) << "Invalid dst vertex id: " << dst;
576
577
578
579
    return aten::CSRIsNonZero(adj_, src, dst);
  }

  BoolArray HasEdgesBetween(dgl_type_t etype, IdArray src_ids, IdArray dst_ids) const override {
580
581
    CHECK(aten::IsValidIdArray(src_ids)) << "Invalid vertex id array.";
    CHECK(aten::IsValidIdArray(dst_ids)) << "Invalid vertex id array.";
582
583
584
585
586
587
588
589
590
    return aten::CSRIsNonZero(adj_, src_ids, dst_ids);
  }

  IdArray Predecessors(dgl_type_t etype, dgl_id_t dst) const override {
    LOG(INFO) << "Not enabled for CSR graph.";
    return {};
  }

  IdArray Successors(dgl_type_t etype, dgl_id_t src) const override {
Minjie Wang's avatar
Minjie Wang committed
591
    CHECK(HasVertex(SrcType(), src)) << "Invalid src vertex id: " << src;
592
593
594
595
    return aten::CSRGetRowColumnIndices(adj_, src);
  }

  IdArray EdgeId(dgl_type_t etype, dgl_id_t src, dgl_id_t dst) const override {
Minjie Wang's avatar
Minjie Wang committed
596
597
    CHECK(HasVertex(SrcType(), src)) << "Invalid src vertex id: " << src;
    CHECK(HasVertex(DstType(), dst)) << "Invalid dst vertex id: " << dst;
598
    return aten::CSRGetAllData(adj_, src, dst);
599
600
  }

601
  EdgeArray EdgeIdsAll(dgl_type_t etype, IdArray src, IdArray dst) const override {
602
603
    CHECK(aten::IsValidIdArray(src)) << "Invalid vertex id array.";
    CHECK(aten::IsValidIdArray(dst)) << "Invalid vertex id array.";
604
605
606
607
    const auto& arrs = aten::CSRGetDataAndIndices(adj_, src, dst);
    return EdgeArray{arrs[0], arrs[1], arrs[2]};
  }

608
609
610
611
  IdArray EdgeIdsOne(dgl_type_t etype, IdArray src, IdArray dst) const override {
    return aten::CSRGetData(adj_, src, dst);
  }

612
  std::pair<dgl_id_t, dgl_id_t> FindEdge(dgl_type_t etype, dgl_id_t eid) const override {
613
    LOG(FATAL) << "Not enabled for CSR graph.";
614
615
616
617
    return {};
  }

  EdgeArray FindEdges(dgl_type_t etype, IdArray eids) const override {
618
    LOG(FATAL) << "Not enabled for CSR graph.";
619
620
621
622
    return {};
  }

  EdgeArray InEdges(dgl_type_t etype, dgl_id_t vid) const override {
623
    LOG(FATAL) << "Not enabled for CSR graph.";
624
625
626
627
    return {};
  }

  EdgeArray InEdges(dgl_type_t etype, IdArray vids) const override {
628
    LOG(FATAL) << "Not enabled for CSR graph.";
629
630
631
632
    return {};
  }

  EdgeArray OutEdges(dgl_type_t etype, dgl_id_t vid) const override {
Minjie Wang's avatar
Minjie Wang committed
633
    CHECK(HasVertex(SrcType(), vid)) << "Invalid src vertex id: " << vid;
634
635
636
637
638
639
640
    IdArray ret_dst = aten::CSRGetRowColumnIndices(adj_, vid);
    IdArray ret_eid = aten::CSRGetRowData(adj_, vid);
    IdArray ret_src = aten::Full(vid, ret_dst->shape[0], NumBits(), ret_dst->ctx);
    return EdgeArray{ret_src, ret_dst, ret_eid};
  }

  EdgeArray OutEdges(dgl_type_t etype, IdArray vids) const override {
641
    CHECK(aten::IsValidIdArray(vids)) << "Invalid vertex id array.";
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
    auto csrsubmat = aten::CSRSliceRows(adj_, vids);
    auto coosubmat = aten::CSRToCOO(csrsubmat, false);
    // Note that the row id in the csr submat is relabled, so
    // we need to recover it using an index select.
    auto row = aten::IndexSelect(vids, coosubmat.row);
    return EdgeArray{row, coosubmat.col, coosubmat.data};
  }

  EdgeArray Edges(dgl_type_t etype, const std::string &order = "") const override {
    CHECK(order.empty() || order == std::string("srcdst"))
      << "CSR only support Edges of order \"srcdst\","
      << " but got \"" << order << "\".";
    const auto& coo = aten::CSRToCOO(adj_, false);
    return EdgeArray{coo.row, coo.col, coo.data};
  }

  uint64_t InDegree(dgl_type_t etype, dgl_id_t vid) const override {
659
    LOG(FATAL) << "Not enabled for CSR graph.";
660
661
662
663
    return {};
  }

  DegreeArray InDegrees(dgl_type_t etype, IdArray vids) const override {
664
    LOG(FATAL) << "Not enabled for CSR graph.";
665
666
667
668
    return {};
  }

  uint64_t OutDegree(dgl_type_t etype, dgl_id_t vid) const override {
Minjie Wang's avatar
Minjie Wang committed
669
    CHECK(HasVertex(SrcType(), vid)) << "Invalid src vertex id: " << vid;
670
671
672
673
    return aten::CSRGetRowNNZ(adj_, vid);
  }

  DegreeArray OutDegrees(dgl_type_t etype, IdArray vids) const override {
674
    CHECK(aten::IsValidIdArray(vids)) << "Invalid vertex id array.";
675
676
677
678
679
680
    return aten::CSRGetRowNNZ(adj_, vids);
  }

  DGLIdIters SuccVec(dgl_type_t etype, dgl_id_t vid) const override {
    // TODO(minjie): This still assumes the data type and device context
    //   of this graph. Should fix later.
681
    CHECK_EQ(NumBits(), 64);
682
683
684
685
686
687
688
    const dgl_id_t* indptr_data = static_cast<dgl_id_t*>(adj_.indptr->data);
    const dgl_id_t* indices_data = static_cast<dgl_id_t*>(adj_.indices->data);
    const dgl_id_t start = indptr_data[vid];
    const dgl_id_t end = indptr_data[vid + 1];
    return DGLIdIters(indices_data + start, indices_data + end);
  }

689
690
691
692
693
694
695
696
697
698
  DGLIdIters32 SuccVec32(dgl_type_t etype, dgl_id_t vid) {
    // TODO(minjie): This still assumes the data type and device context
    //   of this graph. Should fix later.
    const int32_t* indptr_data = static_cast<int32_t*>(adj_.indptr->data);
    const int32_t* indices_data = static_cast<int32_t*>(adj_.indices->data);
    const int32_t start = indptr_data[vid];
    const int32_t end = indptr_data[vid + 1];
    return DGLIdIters32(indices_data + start, indices_data + end);
  }

699
700
701
  DGLIdIters OutEdgeVec(dgl_type_t etype, dgl_id_t vid) const override {
    // TODO(minjie): This still assumes the data type and device context
    //   of this graph. Should fix later.
702
    CHECK_EQ(NumBits(), 64);
703
704
705
706
707
708
709
710
    const dgl_id_t* indptr_data = static_cast<dgl_id_t*>(adj_.indptr->data);
    const dgl_id_t* eid_data = static_cast<dgl_id_t*>(adj_.data->data);
    const dgl_id_t start = indptr_data[vid];
    const dgl_id_t end = indptr_data[vid + 1];
    return DGLIdIters(eid_data + start, eid_data + end);
  }

  DGLIdIters PredVec(dgl_type_t etype, dgl_id_t vid) const override {
711
    LOG(FATAL) << "Not enabled for CSR graph.";
712
713
714
715
    return {};
  }

  DGLIdIters InEdgeVec(dgl_type_t etype, dgl_id_t vid) const override {
716
    LOG(FATAL) << "Not enabled for CSR graph.";
717
718
719
720
721
722
723
724
725
    return {};
  }

  std::vector<IdArray> GetAdj(
      dgl_type_t etype, bool transpose, const std::string &fmt) const override {
    CHECK(!transpose && fmt == "csr") << "Not valid adj format request.";
    return {adj_.indptr, adj_.indices, adj_.data};
  }

726
727
728
729
730
731
732
733
734
735
736
737
738
739
  aten::COOMatrix GetCOOMatrix(dgl_type_t etype) const override {
    LOG(FATAL) << "Not enabled for CSR graph";
    return aten::COOMatrix();
  }

  aten::CSRMatrix GetCSCMatrix(dgl_type_t etype) const override {
    LOG(FATAL) << "Not enabled for CSR graph";
    return aten::CSRMatrix();
  }

  aten::CSRMatrix GetCSRMatrix(dgl_type_t etype) const override {
    return adj_;
  }

740
  SparseFormat SelectFormat(dgl_type_t etype, dgl_format_code_t preferred_formats) const override {
741
    LOG(FATAL) << "Not enabled for CSR graph";
742
    return SparseFormat::kCSR;
743
744
  }

745
746
747
  dgl_format_code_t GetAllowedFormats() const override {
    LOG(FATAL) << "Not enabled for COO graph";
    return 0;
748
749
  }

750
  dgl_format_code_t GetCreatedFormats() const override {
751
752
753
754
    LOG(FATAL) << "Not enabled for CSR graph";
    return 0;
  }

755
  HeteroSubgraph VertexSubgraph(const std::vector<IdArray>& vids) const override {
Minjie Wang's avatar
Minjie Wang committed
756
757
758
759
    CHECK_EQ(vids.size(), NumVertexTypes()) << "Number of vertex types mismatch";
    auto srcvids = vids[SrcType()], dstvids = vids[DstType()];
    CHECK(aten::IsValidIdArray(srcvids)) << "Invalid vertex id array.";
    CHECK(aten::IsValidIdArray(dstvids)) << "Invalid vertex id array.";
760
    HeteroSubgraph subg;
Minjie Wang's avatar
Minjie Wang committed
761
    const auto& submat = aten::CSRSliceMatrix(adj_, srcvids, dstvids);
762
    IdArray sub_eids = aten::Range(0, submat.data->shape[0], NumBits(), Context());
Minjie Wang's avatar
Minjie Wang committed
763
    subg.graph = std::make_shared<CSR>(meta_graph(), submat.num_rows, submat.num_cols,
764
765
766
767
768
769
770
771
        submat.indptr, submat.indices, sub_eids);
    subg.induced_vertices = vids;
    subg.induced_edges.emplace_back(submat.data);
    return subg;
  }

  HeteroSubgraph EdgeSubgraph(
      const std::vector<IdArray>& eids, bool preserve_nodes = false) const override {
772
    LOG(FATAL) << "Not enabled for CSR graph.";
773
774
775
    return {};
  }

776
  HeteroGraphPtr GetGraphInFormat(dgl_format_code_t formats) const override {
777
778
779
780
    LOG(FATAL) << "Not enabled for CSR graph.";
    return nullptr;
  }

781
782
783
784
  aten::CSRMatrix adj() const {
    return adj_;
  }

785
786
787
788
789
790
791
792
793
794
795
796
797
  bool Load(dmlc::Stream* fs) {
    auto meta_imgraph = Serializer::make_shared<ImmutableGraph>();
    CHECK(fs->Read(&meta_imgraph)) << "Invalid meta graph";
    meta_graph_ = meta_imgraph;
    CHECK(fs->Read(&adj_)) << "Invalid adj matrix";
    return true;
  }
  void Save(dmlc::Stream* fs) const {
    auto meta_graph_ptr = ImmutableGraph::ToImmutable(meta_graph());
    fs->Write(meta_graph_ptr);
    fs->Write(adj_);
  }

798
 private:
799
800
  friend class Serializer;

801
802
803
804
805
806
  /*! \brief internal adjacency matrix. Data array stores edge ids */
  aten::CSRMatrix adj_;
};

//////////////////////////////////////////////////////////
//
Minjie Wang's avatar
Minjie Wang committed
807
// unit graph implementation
808
809
810
//
//////////////////////////////////////////////////////////

811
812
813
814
DLDataType UnitGraph::DataType() const {
  return GetAny()->DataType();
}

Minjie Wang's avatar
Minjie Wang committed
815
DLContext UnitGraph::Context() const {
816
817
818
  return GetAny()->Context();
}

Minjie Wang's avatar
Minjie Wang committed
819
uint8_t UnitGraph::NumBits() const {
820
821
822
  return GetAny()->NumBits();
}

Minjie Wang's avatar
Minjie Wang committed
823
bool UnitGraph::IsMultigraph() const {
824
825
826
  const SparseFormat fmt = SelectFormat(csc_code);
  const auto ptr = GetFormat(fmt);
  return ptr->IsMultigraph();
827
828
}

Minjie Wang's avatar
Minjie Wang committed
829
uint64_t UnitGraph::NumVertices(dgl_type_t vtype) const {
830
  const SparseFormat fmt = SelectFormat(all_code);
831
832
833
  const auto ptr = GetFormat(fmt);
  // TODO(BarclayII): we have a lot of special handling for CSC.
  // Need to have a UnitGraph::CSC backend instead.
834
  if (fmt == SparseFormat::kCSC)
Minjie Wang's avatar
Minjie Wang committed
835
    vtype = (vtype == SrcType()) ? DstType() : SrcType();
836
  return ptr->NumVertices(vtype);
837
838
}

Minjie Wang's avatar
Minjie Wang committed
839
uint64_t UnitGraph::NumEdges(dgl_type_t etype) const {
840
841
842
  return GetAny()->NumEdges(etype);
}

Minjie Wang's avatar
Minjie Wang committed
843
bool UnitGraph::HasVertex(dgl_type_t vtype, dgl_id_t vid) const {
844
  const SparseFormat fmt = SelectFormat(all_code);
845
  const auto ptr = GetFormat(fmt);
846
  if (fmt == SparseFormat::kCSC)
Minjie Wang's avatar
Minjie Wang committed
847
    vtype = (vtype == SrcType()) ? DstType() : SrcType();
848
  return ptr->HasVertex(vtype, vid);
849
850
}

Minjie Wang's avatar
Minjie Wang committed
851
BoolArray UnitGraph::HasVertices(dgl_type_t vtype, IdArray vids) const {
852
  CHECK(aten::IsValidIdArray(vids)) << "Invalid id array input";
853
854
855
  return aten::LT(vids, NumVertices(vtype));
}

Minjie Wang's avatar
Minjie Wang committed
856
bool UnitGraph::HasEdgeBetween(dgl_type_t etype, dgl_id_t src, dgl_id_t dst) const {
857
  const SparseFormat fmt = SelectFormat(csc_code);
858
  const auto ptr = GetFormat(fmt);
859
  if (fmt == SparseFormat::kCSC)
860
861
862
    return ptr->HasEdgeBetween(etype, dst, src);
  else
    return ptr->HasEdgeBetween(etype, src, dst);
863
864
}

Minjie Wang's avatar
Minjie Wang committed
865
BoolArray UnitGraph::HasEdgesBetween(
866
    dgl_type_t etype, IdArray src, IdArray dst) const {
867
  const SparseFormat fmt = SelectFormat(csc_code);
868
  const auto ptr = GetFormat(fmt);
869
  if (fmt == SparseFormat::kCSC)
870
871
872
    return ptr->HasEdgesBetween(etype, dst, src);
  else
    return ptr->HasEdgesBetween(etype, src, dst);
873
874
}

Minjie Wang's avatar
Minjie Wang committed
875
IdArray UnitGraph::Predecessors(dgl_type_t etype, dgl_id_t dst) const {
876
  const SparseFormat fmt = SelectFormat(csc_code);
877
  const auto ptr = GetFormat(fmt);
878
  if (fmt == SparseFormat::kCSC)
879
880
881
    return ptr->Successors(etype, dst);
  else
    return ptr->Predecessors(etype, dst);
882
883
}

Minjie Wang's avatar
Minjie Wang committed
884
IdArray UnitGraph::Successors(dgl_type_t etype, dgl_id_t src) const {
885
  const SparseFormat fmt = SelectFormat(csr_code);
886
887
  const auto ptr = GetFormat(fmt);
  return ptr->Successors(etype, src);
888
889
}

Minjie Wang's avatar
Minjie Wang committed
890
IdArray UnitGraph::EdgeId(dgl_type_t etype, dgl_id_t src, dgl_id_t dst) const {
891
  const SparseFormat fmt = SelectFormat(csr_code);
892
  const auto ptr = GetFormat(fmt);
893
  if (fmt == SparseFormat::kCSC)
894
895
896
    return ptr->EdgeId(etype, dst, src);
  else
    return ptr->EdgeId(etype, src, dst);
897
898
}

899
900
EdgeArray UnitGraph::EdgeIdsAll(dgl_type_t etype, IdArray src, IdArray dst) const {
  const SparseFormat fmt = SelectFormat(csr_code);
901
  const auto ptr = GetFormat(fmt);
902
  if (fmt == SparseFormat::kCSC) {
903
    EdgeArray edges = ptr->EdgeIdsAll(etype, dst, src);
904
905
    return EdgeArray{edges.dst, edges.src, edges.id};
  } else {
906
907
908
909
910
911
912
913
914
915
916
    return ptr->EdgeIdsAll(etype, src, dst);
  }
}

IdArray UnitGraph::EdgeIdsOne(dgl_type_t etype, IdArray src, IdArray dst) const {
  const SparseFormat fmt = SelectFormat(csr_code);
  const auto ptr = GetFormat(fmt);
  if (fmt == SparseFormat::kCSC) {
    return ptr->EdgeIdsOne(etype, dst, src);
  } else {
    return ptr->EdgeIdsOne(etype, src, dst);
917
918
919
  }
}

Minjie Wang's avatar
Minjie Wang committed
920
std::pair<dgl_id_t, dgl_id_t> UnitGraph::FindEdge(dgl_type_t etype, dgl_id_t eid) const {
921
  const SparseFormat fmt = SelectFormat(coo_code);
922
923
  const auto ptr = GetFormat(fmt);
  return ptr->FindEdge(etype, eid);
924
925
}

Minjie Wang's avatar
Minjie Wang committed
926
EdgeArray UnitGraph::FindEdges(dgl_type_t etype, IdArray eids) const {
927
  const SparseFormat fmt = SelectFormat(coo_code);
928
929
  const auto ptr = GetFormat(fmt);
  return ptr->FindEdges(etype, eids);
930
931
}

Minjie Wang's avatar
Minjie Wang committed
932
EdgeArray UnitGraph::InEdges(dgl_type_t etype, dgl_id_t vid) const {
933
  const SparseFormat fmt = SelectFormat(csc_code);
934
  const auto ptr = GetFormat(fmt);
935
  if (fmt == SparseFormat::kCSC) {
936
937
938
939
940
    const EdgeArray& ret = ptr->OutEdges(etype, vid);
    return {ret.dst, ret.src, ret.id};
  } else {
    return ptr->InEdges(etype, vid);
  }
941
942
}

Minjie Wang's avatar
Minjie Wang committed
943
EdgeArray UnitGraph::InEdges(dgl_type_t etype, IdArray vids) const {
944
  const SparseFormat fmt = SelectFormat(csc_code);
945
  const auto ptr = GetFormat(fmt);
946
  if (fmt == SparseFormat::kCSC) {
947
948
949
950
951
    const EdgeArray& ret = ptr->OutEdges(etype, vids);
    return {ret.dst, ret.src, ret.id};
  } else {
    return ptr->InEdges(etype, vids);
  }
952
953
}

Minjie Wang's avatar
Minjie Wang committed
954
EdgeArray UnitGraph::OutEdges(dgl_type_t etype, dgl_id_t vid) const {
955
  const SparseFormat fmt = SelectFormat(csr_code);
956
957
  const auto ptr = GetFormat(fmt);
  return ptr->OutEdges(etype, vid);
958
959
}

Minjie Wang's avatar
Minjie Wang committed
960
EdgeArray UnitGraph::OutEdges(dgl_type_t etype, IdArray vids) const {
961
  const SparseFormat fmt = SelectFormat(csr_code);
962
963
  const auto ptr = GetFormat(fmt);
  return ptr->OutEdges(etype, vids);
964
965
}

Minjie Wang's avatar
Minjie Wang committed
966
EdgeArray UnitGraph::Edges(dgl_type_t etype, const std::string &order) const {
967
968
  SparseFormat fmt;
  if (order == std::string("eid")) {
969
    fmt = SelectFormat(coo_code);
970
  } else if (order.empty()) {
971
    // arbitrary order
972
    fmt = SelectFormat(all_code);
973
  } else if (order == std::string("srcdst")) {
974
    fmt = SelectFormat(csr_code);
975
976
  } else {
    LOG(FATAL) << "Unsupported order request: " << order;
977
    return {};
978
  }
979
980

  const auto& edges = GetFormat(fmt)->Edges(etype, order);
981
  if (fmt == SparseFormat::kCSC)
982
983
984
    return EdgeArray{edges.dst, edges.src, edges.id};
  else
    return edges;
985
986
}

Minjie Wang's avatar
Minjie Wang committed
987
uint64_t UnitGraph::InDegree(dgl_type_t etype, dgl_id_t vid) const {
988
  SparseFormat fmt = SelectFormat(csc_code);
989
  const auto ptr = GetFormat(fmt);
990
  if (fmt == SparseFormat::kCSC)
991
992
993
    return ptr->OutDegree(etype, vid);
  else
    return ptr->InDegree(etype, vid);
994
995
}

Minjie Wang's avatar
Minjie Wang committed
996
DegreeArray UnitGraph::InDegrees(dgl_type_t etype, IdArray vids) const {
997
  SparseFormat fmt = SelectFormat(csc_code);
998
  const auto ptr = GetFormat(fmt);
999
  if (fmt == SparseFormat::kCSC)
1000
1001
1002
    return ptr->OutDegrees(etype, vids);
  else
    return ptr->InDegrees(etype, vids);
1003
1004
}

Minjie Wang's avatar
Minjie Wang committed
1005
uint64_t UnitGraph::OutDegree(dgl_type_t etype, dgl_id_t vid) const {
1006
  SparseFormat fmt = SelectFormat(csr_code);
1007
1008
  const auto ptr = GetFormat(fmt);
  return ptr->OutDegree(etype, vid);
1009
1010
}

Minjie Wang's avatar
Minjie Wang committed
1011
DegreeArray UnitGraph::OutDegrees(dgl_type_t etype, IdArray vids) const {
1012
  SparseFormat fmt = SelectFormat(csr_code);
1013
1014
  const auto ptr = GetFormat(fmt);
  return ptr->OutDegrees(etype, vids);
1015
1016
}

Minjie Wang's avatar
Minjie Wang committed
1017
DGLIdIters UnitGraph::SuccVec(dgl_type_t etype, dgl_id_t vid) const {
1018
  SparseFormat fmt = SelectFormat(csr_code);
1019
1020
  const auto ptr = GetFormat(fmt);
  return ptr->SuccVec(etype, vid);
1021
1022
}

1023
DGLIdIters32 UnitGraph::SuccVec32(dgl_type_t etype, dgl_id_t vid) const {
1024
  SparseFormat fmt = SelectFormat(csr_code);
1025
1026
1027
1028
1029
  const auto ptr = std::dynamic_pointer_cast<CSR>(GetFormat(fmt));
  CHECK_NOTNULL(ptr);
  return ptr->SuccVec32(etype, vid);
}

Minjie Wang's avatar
Minjie Wang committed
1030
DGLIdIters UnitGraph::OutEdgeVec(dgl_type_t etype, dgl_id_t vid) const {
1031
  SparseFormat fmt = SelectFormat(csr_code);
1032
1033
  const auto ptr = GetFormat(fmt);
  return ptr->OutEdgeVec(etype, vid);
1034
1035
}

Minjie Wang's avatar
Minjie Wang committed
1036
DGLIdIters UnitGraph::PredVec(dgl_type_t etype, dgl_id_t vid) const {
1037
  SparseFormat fmt = SelectFormat(csc_code);
1038
  const auto ptr = GetFormat(fmt);
1039
  if (fmt == SparseFormat::kCSC)
1040
1041
1042
    return ptr->SuccVec(etype, vid);
  else
    return ptr->PredVec(etype, vid);
1043
1044
}

Minjie Wang's avatar
Minjie Wang committed
1045
DGLIdIters UnitGraph::InEdgeVec(dgl_type_t etype, dgl_id_t vid) const {
1046
  SparseFormat fmt = SelectFormat(csc_code);
1047
  const auto ptr = GetFormat(fmt);
1048
  if (fmt == SparseFormat::kCSC)
1049
1050
1051
    return ptr->OutEdgeVec(etype, vid);
  else
    return ptr->InEdgeVec(etype, vid);
1052
1053
}

Minjie Wang's avatar
Minjie Wang committed
1054
std::vector<IdArray> UnitGraph::GetAdj(
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
    dgl_type_t etype, bool transpose, const std::string &fmt) const {
  // TODO(minjie): Our current semantics of adjacency matrix is row for dst nodes and col for
  //   src nodes. Therefore, we need to flip the transpose flag. For example, transpose=False
  //   is equal to in edge CSR.
  //   We have this behavior because previously we use framework's SPMM and we don't cache
  //   reverse adj. This is not intuitive and also not consistent with networkx's
  //   to_scipy_sparse_matrix. With the upcoming custom kernel change, we should change the
  //   behavior and make row for src and col for dst.
  if (fmt == std::string("csr")) {
    return transpose? GetOutCSR()->GetAdj(etype, false, "csr")
      : GetInCSR()->GetAdj(etype, false, "csr");
  } else if (fmt == std::string("coo")) {
    return GetCOO()->GetAdj(etype, !transpose, fmt);
  } else {
    LOG(FATAL) << "unsupported adjacency matrix format: " << fmt;
    return {};
  }
}

Minjie Wang's avatar
Minjie Wang committed
1074
HeteroSubgraph UnitGraph::VertexSubgraph(const std::vector<IdArray>& vids) const {
1075
  // We prefer to generate a subgraph from out-csr.
1076
  SparseFormat fmt = SelectFormat(csr_code);
1077
  HeteroSubgraph sg = GetFormat(fmt)->VertexSubgraph(vids);
1078
  HeteroSubgraph ret;
Quan (Andy) Gan's avatar
Quan (Andy) Gan committed
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098

  CSRPtr subcsr = nullptr;
  CSRPtr subcsc = nullptr;
  COOPtr subcoo = nullptr;
  switch (fmt) {
    case SparseFormat::kCSR:
      subcsr = std::dynamic_pointer_cast<CSR>(sg.graph);
      break;
    case SparseFormat::kCSC:
      subcsc = std::dynamic_pointer_cast<CSR>(sg.graph);
      break;
    case SparseFormat::kCOO:
      subcoo = std::dynamic_pointer_cast<COO>(sg.graph);
      break;
    default:
      LOG(FATAL) << "[BUG] unsupported format " << static_cast<int>(fmt);
      return ret;
  }

  ret.graph = HeteroGraphPtr(new UnitGraph(meta_graph(), subcsc, subcsr, subcoo));
1099
1100
1101
1102
1103
  ret.induced_vertices = std::move(sg.induced_vertices);
  ret.induced_edges = std::move(sg.induced_edges);
  return ret;
}

Minjie Wang's avatar
Minjie Wang committed
1104
HeteroSubgraph UnitGraph::EdgeSubgraph(
1105
    const std::vector<IdArray>& eids, bool preserve_nodes) const {
1106
  SparseFormat fmt = SelectFormat(coo_code);
1107
  auto sg = GetFormat(fmt)->EdgeSubgraph(eids, preserve_nodes);
1108
  HeteroSubgraph ret;
Quan (Andy) Gan's avatar
Quan (Andy) Gan committed
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128

  CSRPtr subcsr = nullptr;
  CSRPtr subcsc = nullptr;
  COOPtr subcoo = nullptr;
  switch (fmt) {
    case SparseFormat::kCSR:
      subcsr = std::dynamic_pointer_cast<CSR>(sg.graph);
      break;
    case SparseFormat::kCSC:
      subcsc = std::dynamic_pointer_cast<CSR>(sg.graph);
      break;
    case SparseFormat::kCOO:
      subcoo = std::dynamic_pointer_cast<COO>(sg.graph);
      break;
    default:
      LOG(FATAL) << "[BUG] unsupported format " << static_cast<int>(fmt);
      return ret;
  }

  ret.graph = HeteroGraphPtr(new UnitGraph(meta_graph(), subcsc, subcsr, subcoo));
1129
1130
1131
1132
1133
  ret.induced_vertices = std::move(sg.induced_vertices);
  ret.induced_edges = std::move(sg.induced_edges);
  return ret;
}

Minjie Wang's avatar
Minjie Wang committed
1134
HeteroGraphPtr UnitGraph::CreateFromCOO(
1135
1136
    int64_t num_vtypes, int64_t num_src, int64_t num_dst,
    IdArray row, IdArray col,
1137
    dgl_format_code_t formats) {
Minjie Wang's avatar
Minjie Wang committed
1138
1139
1140
1141
1142
  CHECK(num_vtypes == 1 || num_vtypes == 2);
  if (num_vtypes == 1)
    CHECK_EQ(num_src, num_dst);
  auto mg = CreateUnitGraphMetaGraph(num_vtypes);
  COOPtr coo(new COO(mg, num_src, num_dst, row, col));
1143
1144

  return HeteroGraphPtr(
1145
      new UnitGraph(mg, nullptr, nullptr, coo, formats));
1146
1147
}

1148
1149
HeteroGraphPtr UnitGraph::CreateFromCOO(
    int64_t num_vtypes, const aten::COOMatrix& mat,
1150
    dgl_format_code_t formats) {
1151
1152
1153
1154
1155
  CHECK(num_vtypes == 1 || num_vtypes == 2);
  if (num_vtypes == 1)
    CHECK_EQ(mat.num_rows, mat.num_cols);
  auto mg = CreateUnitGraphMetaGraph(num_vtypes);
  COOPtr coo(new COO(mg, mat));
1156

1157
  return HeteroGraphPtr(
1158
      new UnitGraph(mg, nullptr, nullptr, coo, formats));
1159
1160
}

Minjie Wang's avatar
Minjie Wang committed
1161
1162
HeteroGraphPtr UnitGraph::CreateFromCSR(
    int64_t num_vtypes, int64_t num_src, int64_t num_dst,
1163
    IdArray indptr, IdArray indices, IdArray edge_ids, dgl_format_code_t formats) {
Minjie Wang's avatar
Minjie Wang committed
1164
1165
1166
1167
1168
  CHECK(num_vtypes == 1 || num_vtypes == 2);
  if (num_vtypes == 1)
    CHECK_EQ(num_src, num_dst);
  auto mg = CreateUnitGraphMetaGraph(num_vtypes);
  CSRPtr csr(new CSR(mg, num_src, num_dst, indptr, indices, edge_ids));
1169
  return HeteroGraphPtr(new UnitGraph(mg, nullptr, csr, nullptr, formats));
1170
1171
}

1172
1173
HeteroGraphPtr UnitGraph::CreateFromCSR(
    int64_t num_vtypes, const aten::CSRMatrix& mat,
1174
    dgl_format_code_t formats) {
1175
1176
1177
1178
1179
  CHECK(num_vtypes == 1 || num_vtypes == 2);
  if (num_vtypes == 1)
    CHECK_EQ(mat.num_rows, mat.num_cols);
  auto mg = CreateUnitGraphMetaGraph(num_vtypes);
  CSRPtr csr(new CSR(mg, mat));
1180
  return HeteroGraphPtr(new UnitGraph(mg, nullptr, csr, nullptr, formats));
1181
1182
}

1183
1184
HeteroGraphPtr UnitGraph::CreateFromCSC(
    int64_t num_vtypes, int64_t num_src, int64_t num_dst,
1185
    IdArray indptr, IdArray indices, IdArray edge_ids, dgl_format_code_t formats) {
1186
1187
1188
1189
1190
  CHECK(num_vtypes == 1 || num_vtypes == 2);
  if (num_vtypes == 1)
    CHECK_EQ(num_src, num_dst);
  auto mg = CreateUnitGraphMetaGraph(num_vtypes);
  CSRPtr csc(new CSR(mg, num_src, num_dst, indptr, indices, edge_ids));
1191
  return HeteroGraphPtr(new UnitGraph(mg, csc, nullptr, nullptr, formats));
1192
1193
1194
1195
}

HeteroGraphPtr UnitGraph::CreateFromCSC(
    int64_t num_vtypes, const aten::CSRMatrix& mat,
1196
    dgl_format_code_t formats) {
1197
1198
1199
1200
1201
  CHECK(num_vtypes == 1 || num_vtypes == 2);
  if (num_vtypes == 1)
    CHECK_EQ(mat.num_rows, mat.num_cols);
  auto mg = CreateUnitGraphMetaGraph(num_vtypes);
  CSRPtr csc(new CSR(mg, mat));
1202
  return HeteroGraphPtr(new UnitGraph(mg, csc, nullptr, nullptr, formats));
1203
1204
}

Minjie Wang's avatar
Minjie Wang committed
1205
HeteroGraphPtr UnitGraph::AsNumBits(HeteroGraphPtr g, uint8_t bits) {
1206
1207
1208
  if (g->NumBits() == bits) {
    return g;
  } else {
Minjie Wang's avatar
Minjie Wang committed
1209
    auto bg = std::dynamic_pointer_cast<UnitGraph>(g);
1210
    CHECK_NOTNULL(bg);
1211
1212
1213
1214
1215
1216
    CSRPtr new_incsr =
      (bg->in_csr_->defined())? CSRPtr(new CSR(bg->in_csr_->AsNumBits(bits))) : nullptr;
    CSRPtr new_outcsr =
      (bg->out_csr_->defined())? CSRPtr(new CSR(bg->out_csr_->AsNumBits(bits))) : nullptr;
    COOPtr new_coo =
      (bg->coo_->defined())? COOPtr(new COO(bg->coo_->AsNumBits(bits))) : nullptr;
1217
    return HeteroGraphPtr(
1218
        new UnitGraph(g->meta_graph(), new_incsr, new_outcsr, new_coo, bg->formats_));
1219
1220
1221
  }
}

Minjie Wang's avatar
Minjie Wang committed
1222
HeteroGraphPtr UnitGraph::CopyTo(HeteroGraphPtr g, const DLContext& ctx) {
1223
1224
  if (ctx == g->Context()) {
    return g;
1225
1226
1227
  } else {
    auto bg = std::dynamic_pointer_cast<UnitGraph>(g);
    CHECK_NOTNULL(bg);
1228
1229
1230
1231
1232
1233
    CSRPtr new_incsr =
      (bg->in_csr_->defined())? CSRPtr(new CSR(bg->in_csr_->CopyTo(ctx))) : nullptr;
    CSRPtr new_outcsr =
      (bg->out_csr_->defined())? CSRPtr(new CSR(bg->out_csr_->CopyTo(ctx))) : nullptr;
    COOPtr new_coo =
      (bg->coo_->defined())? COOPtr(new COO(bg->coo_->CopyTo(ctx))) : nullptr;
1234
    return HeteroGraphPtr(
1235
        new UnitGraph(g->meta_graph(), new_incsr, new_outcsr, new_coo, bg->formats_));
1236
1237
1238
  }
}

1239
UnitGraph::UnitGraph(GraphPtr metagraph, CSRPtr in_csr, CSRPtr out_csr, COOPtr coo,
1240
                     dgl_format_code_t formats)
Minjie Wang's avatar
Minjie Wang committed
1241
  : BaseHeteroGraph(metagraph), in_csr_(in_csr), out_csr_(out_csr), coo_(coo) {
1242
1243
1244
1245
1246
1247
1248
1249
1250
  if (!in_csr_) {
    in_csr_ = CSRPtr(new CSR());
  }
  if (!out_csr_) {
    out_csr_ = CSRPtr(new CSR());
  }
  if (!coo_) {
    coo_ = COOPtr(new COO());
  }
1251
1252
1253
1254
1255
  formats_ = formats;
  dgl_format_code_t created = GetCreatedFormats();
  if ((formats | created) != formats)
    LOG(FATAL) << "Graph created from formats: " << CodeToStr(created) <<
      ", which is not compatible with available formats: " << CodeToStr(formats);
1256
1257
1258
  CHECK(GetAny()) << "At least one graph structure should exist.";
}

1259
1260
1261
1262
1263
1264
1265
HeteroGraphPtr UnitGraph::CreateHomographFrom(
    const aten::CSRMatrix &in_csr,
    const aten::CSRMatrix &out_csr,
    const aten::COOMatrix &coo,
    bool has_in_csr,
    bool has_out_csr,
    bool has_coo,
1266
    dgl_format_code_t formats) {
1267
1268
1269
1270
1271
1272
1273
1274
  auto mg = CreateUnitGraphMetaGraph1();

  CSRPtr in_csr_ptr = nullptr;
  CSRPtr out_csr_ptr = nullptr;
  COOPtr coo_ptr = nullptr;

  if (has_in_csr)
    in_csr_ptr = CSRPtr(new CSR(mg, in_csr));
1275
1276
  else
    in_csr_ptr = CSRPtr(new CSR());
1277
1278
  if (has_out_csr)
    out_csr_ptr = CSRPtr(new CSR(mg, out_csr));
1279
1280
  else
    out_csr_ptr = CSRPtr(new CSR());
1281
1282
  if (has_coo)
    coo_ptr = COOPtr(new COO(mg, coo));
1283
1284
  else
    coo_ptr = COOPtr(new COO());
1285

1286
  return HeteroGraphPtr(new UnitGraph(mg, in_csr_ptr, out_csr_ptr, coo_ptr, formats));
1287
1288
}

1289
1290
UnitGraph::CSRPtr UnitGraph::GetInCSR(bool inplace) const {
  if (inplace)
1291
1292
1293
    if (!(formats_ & csc_code))
      LOG(FATAL) << "The graph have restricted sparse format " <<
        CodeToStr(formats_) << ", cannot create CSC matrix.";
1294
  CSRPtr ret = in_csr_;
1295
1296
  if (!in_csr_->defined()) {
    if (out_csr_->defined()) {
1297
      const auto& newadj = aten::CSRSort(aten::CSRTranspose(out_csr_->adj()));
1298

1299
      if (inplace)
1300
1301
1302
        *(const_cast<UnitGraph*>(this)->in_csr_) = CSR(meta_graph(), newadj);
      else
        ret = std::make_shared<CSR>(meta_graph(), newadj);
1303
    } else {
1304
      CHECK(coo_->defined()) << "None of CSR, COO exist";
1305
1306
      const auto& newadj = aten::CSRSort(aten::COOToCSR(
            aten::COOTranspose(coo_->adj())));
1307

1308
      if (inplace)
1309
1310
1311
        *(const_cast<UnitGraph*>(this)->in_csr_) = CSR(meta_graph(), newadj);
      else
        ret = std::make_shared<CSR>(meta_graph(), newadj);
1312
1313
    }
  }
1314
  return ret;
1315
1316
1317
}

/* !\brief Return out csr. If not exist, transpose the other one.*/
1318
1319
UnitGraph::CSRPtr UnitGraph::GetOutCSR(bool inplace) const {
  if (inplace)
1320
1321
1322
    if (!(formats_ & csr_code))
      LOG(FATAL) << "The graph have restricted sparse format " <<
        CodeToStr(formats_) << ", cannot create CSR matrix.";
1323
  CSRPtr ret = out_csr_;
1324
1325
  if (!out_csr_->defined()) {
    if (in_csr_->defined()) {
1326
      const auto& newadj = aten::CSRSort(aten::CSRTranspose(in_csr_->adj()));
1327

1328
      if (inplace)
1329
1330
1331
        *(const_cast<UnitGraph*>(this)->out_csr_) = CSR(meta_graph(), newadj);
      else
        ret = std::make_shared<CSR>(meta_graph(), newadj);
1332
    } else {
1333
      CHECK(coo_->defined()) << "None of CSR, COO exist";
1334
      const auto& newadj = aten::CSRSort(aten::COOToCSR(coo_->adj()));
1335

1336
      if (inplace)
1337
1338
1339
        *(const_cast<UnitGraph*>(this)->out_csr_) = CSR(meta_graph(), newadj);
      else
        ret = std::make_shared<CSR>(meta_graph(), newadj);
1340
1341
    }
  }
1342
  return ret;
1343
1344
1345
}

/* !\brief Return coo. If not exist, create from csr.*/
1346
1347
UnitGraph::COOPtr UnitGraph::GetCOO(bool inplace) const {
  if (inplace)
1348
1349
1350
    if (!(formats_ & coo_code))
      LOG(FATAL) << "The graph have restricted sparse format " <<
        CodeToStr(formats_) << ", cannot create COO matrix.";
1351
  COOPtr ret = coo_;
1352
1353
  if (!coo_->defined()) {
    if (in_csr_->defined()) {
1354
      const auto& newadj = aten::COOTranspose(aten::CSRToCOO(in_csr_->adj(), true));
1355

1356
      if (inplace)
1357
1358
1359
        *(const_cast<UnitGraph*>(this)->coo_) = COO(meta_graph(), newadj);
      else
        ret = std::make_shared<COO>(meta_graph(), newadj);
1360
    } else {
1361
      CHECK(out_csr_->defined()) << "Both CSR are missing.";
1362
      const auto& newadj = aten::CSRToCOO(out_csr_->adj(), true);
1363

1364
      if (inplace)
1365
1366
1367
        *(const_cast<UnitGraph*>(this)->coo_) = COO(meta_graph(), newadj);
      else
        ret = std::make_shared<COO>(meta_graph(), newadj);
1368
1369
    }
  }
1370
  return ret;
1371
1372
}

1373
aten::CSRMatrix UnitGraph::GetCSCMatrix(dgl_type_t etype) const {
1374
1375
1376
  return GetInCSR()->adj();
}

1377
aten::CSRMatrix UnitGraph::GetCSRMatrix(dgl_type_t etype) const {
1378
1379
1380
  return GetOutCSR()->adj();
}

1381
aten::COOMatrix UnitGraph::GetCOOMatrix(dgl_type_t etype) const {
1382
1383
1384
  return GetCOO()->adj();
}

Minjie Wang's avatar
Minjie Wang committed
1385
HeteroGraphPtr UnitGraph::GetAny() const {
1386
  if (in_csr_->defined()) {
1387
    return in_csr_;
1388
  } else if (out_csr_->defined()) {
1389
1390
1391
1392
1393
1394
    return out_csr_;
  } else {
    return coo_;
  }
}

1395
dgl_format_code_t UnitGraph::GetCreatedFormats() const {
1396
  dgl_format_code_t ret = 0;
1397
1398
1399
1400
1401
1402
  if (in_csr_->defined())
    ret |= csc_code;
  if (out_csr_->defined())
    ret |= csr_code;
  if (coo_->defined())
    ret |= coo_code;
1403
1404
1405
  return ret;
}

1406
1407
1408
1409
dgl_format_code_t UnitGraph::GetAllowedFormats() const {
  return formats_;
}

1410
1411
HeteroGraphPtr UnitGraph::GetFormat(SparseFormat format) const {
  switch (format) {
1412
1413
1414
1415
  case SparseFormat::kCSR:
    return GetOutCSR();
  case SparseFormat::kCSC:
    return GetInCSR();
1416
  default:
1417
    return GetCOO();
1418
1419
1420
  }
}

1421
1422
1423
HeteroGraphPtr UnitGraph::GetGraphInFormat(dgl_format_code_t formats) const {
  if (formats == all_code)
    return HeteroGraphPtr(
1424
1425
        // TODO(xiangsx) Make it as graph storage.Clone()
        new UnitGraph(meta_graph_,
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
                      (in_csr_->defined())
                          ? CSRPtr(new CSR(*in_csr_))
                          : nullptr,
                      (out_csr_->defined())
                          ? CSRPtr(new CSR(*out_csr_))
                          : nullptr,
                      (coo_->defined())
                          ? COOPtr(new COO(*coo_))
                          : nullptr,
                      formats));
  int64_t num_vtypes = NumVertexTypes();
  if (formats & coo_code)
    return CreateFromCOO(num_vtypes, GetCOO(false)->adj(), formats);
  if (formats & csr_code)
    return CreateFromCSR(num_vtypes, GetOutCSR(false)->adj(), formats);
  return CreateFromCSC(num_vtypes, GetInCSR(false)->adj(), formats);
}

SparseFormat UnitGraph::SelectFormat(dgl_format_code_t preferred_formats) const {
  dgl_format_code_t common = preferred_formats & formats_;
  dgl_format_code_t created = GetCreatedFormats();
  if (common & created)
    return DecodeFormat(common & created);
  if (coo_->defined() && coo_->IsHypersparse())  // only allow coo for hypersparse graph.
1450
    return SparseFormat::kCOO;
1451
1452
1453
  if (common)
    return DecodeFormat(common);
  return DecodeFormat(created);
1454
1455
}

1456
1457
1458
1459
GraphPtr UnitGraph::AsImmutableGraph() const {
  CHECK(NumVertexTypes() == 1) << "not a homogeneous graph";
  dgl::CSRPtr in_csr_ptr = nullptr, out_csr_ptr = nullptr;
  dgl::COOPtr coo_ptr = nullptr;
1460
  if (in_csr_->defined()) {
1461
    aten::CSRMatrix csc = GetCSCMatrix(0);
1462
    in_csr_ptr = dgl::CSRPtr(new dgl::CSR(csc.indptr, csc.indices, csc.data));
1463
  }
1464
  if (out_csr_->defined()) {
1465
    aten::CSRMatrix csr = GetCSRMatrix(0);
1466
    out_csr_ptr = dgl::CSRPtr(new dgl::CSR(csr.indptr, csr.indices, csr.data));
1467
  }
1468
  if (coo_->defined()) {
1469
1470
    aten::COOMatrix coo = GetCOOMatrix(0);
    if (!COOHasData(coo)) {
1471
      coo_ptr = dgl::COOPtr(new dgl::COO(NumVertices(0), coo.row, coo.col));
1472
1473
1474
    } else {
      IdArray new_src = Scatter(coo.row, coo.data);
      IdArray new_dst = Scatter(coo.col, coo.data);
1475
      coo_ptr = dgl::COOPtr(new dgl::COO(NumVertices(0), new_src, new_dst));
1476
1477
1478
1479
1480
    }
  }
  return GraphPtr(new dgl::ImmutableGraph(in_csr_ptr, out_csr_ptr, coo_ptr));
}

1481
1482
HeteroGraphPtr UnitGraph::LineGraph(bool backtracking) const {
  // TODO(xiangsx) currently we only support homogeneous graph
1483
  auto fmt = SelectFormat(all_code);
1484
1485
  switch (fmt) {
    case SparseFormat::kCOO: {
1486
      return CreateFromCOO(1, aten::COOLineGraph(coo_->adj(), backtracking));
1487
1488
1489
1490
    }
    case SparseFormat::kCSR: {
      const aten::CSRMatrix csr = GetCSRMatrix(0);
      const aten::COOMatrix coo = aten::COOLineGraph(aten::CSRToCOO(csr, true), backtracking);
1491
      return CreateFromCOO(1, coo);
1492
1493
1494
1495
1496
    }
    case SparseFormat::kCSC: {
      const aten::CSRMatrix csc = GetCSCMatrix(0);
      const aten::CSRMatrix csr = aten::CSRTranspose(csc);
      const aten::COOMatrix coo = aten::COOLineGraph(aten::CSRToCOO(csr, true), backtracking);
1497
      return CreateFromCOO(1, coo);
1498
1499
1500
1501
1502
1503
1504
1505
    }
    default:
      LOG(FATAL) << "None of CSC, CSR, COO exist";
      break;
  }
  return nullptr;
}

1506
1507
1508
1509
1510
1511
constexpr uint64_t kDGLSerialize_UnitGraphMagic = 0xDD2E60F0F6B4A127;

bool UnitGraph::Load(dmlc::Stream* fs) {
  uint64_t magicNum;
  CHECK(fs->Read(&magicNum)) << "Invalid Magic Number";
  CHECK_EQ(magicNum, kDGLSerialize_UnitGraphMagic) << "Invalid UnitGraph Data";
1512

1513
  int64_t save_format_code, formats_code;
1514
  CHECK(fs->Read(&save_format_code)) << "Invalid format";
1515
  CHECK(fs->Read(&formats_code)) << "Invalid format";
1516
  auto save_format = static_cast<SparseFormat>(save_format_code);
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
  if (formats_code >> 32) {
    formats_ = static_cast<dgl_format_code_t>(0xffffffff & formats_code);
  } else {
    // NOTE(zihao): to be compatible with old formats.
    switch (formats_code & 0xffffffff) {
    case 0:
      formats_ = all_code;
      break;
    case 1:
      formats_ = coo_code;
      break;
    case 2:
      formats_ = csr_code;
      break;
    case 3:
      formats_ = csc_code;
      break;
    default:
      LOG(FATAL) << "Load graph failed, formats code " << formats_code <<
        "not recognized.";
    }
  }
1539

1540
  switch (save_format) {
1541
    case SparseFormat::kCOO:
1542
1543
      fs->Read(&coo_);
      break;
1544
    case SparseFormat::kCSR:
1545
1546
      fs->Read(&out_csr_);
      break;
1547
    case SparseFormat::kCSC:
1548
1549
1550
1551
1552
1553
1554
      fs->Read(&in_csr_);
      break;
    default:
      LOG(FATAL) << "unsupported format code";
      break;
  }

1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
  if (!in_csr_) {
    in_csr_ = CSRPtr(new CSR());
  }
  if (!out_csr_) {
    out_csr_ = CSRPtr(new CSR());
  }
  if (!coo_) {
    coo_ = COOPtr(new COO());
  }

1565
1566
  meta_graph_ = GetAny()->meta_graph();

1567
1568
1569
  return true;
}

1570

1571
1572
void UnitGraph::Save(dmlc::Stream* fs) const {
  fs->Write(kDGLSerialize_UnitGraphMagic);
1573
1574
  // Didn't write UnitGraph::meta_graph_, since it's included in the underlying
  // sparse matrix
1575
  auto avail_fmt = SelectFormat(all_code);
1576
  fs->Write(static_cast<int64_t>(avail_fmt));
1577
  fs->Write(static_cast<int64_t>(formats_ | 0x100000000));
1578
  switch (avail_fmt) {
1579
    case SparseFormat::kCOO:
1580
1581
      fs->Write(GetCOO());
      break;
1582
    case SparseFormat::kCSR:
1583
1584
      fs->Write(GetOutCSR());
      break;
1585
    case SparseFormat::kCSC:
1586
1587
1588
1589
1590
1591
      fs->Write(GetInCSR());
      break;
    default:
      LOG(FATAL) << "unsupported format code";
      break;
  }
1592
1593
}

1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
UnitGraphPtr UnitGraph::Reverse() const {
  CSRPtr new_incsr = out_csr_, new_outcsr = in_csr_;
  COOPtr new_coo = nullptr;
  if (coo_->defined()) {
    new_coo = COOPtr(new COO(coo_->meta_graph(), aten::COOTranspose(coo_->adj())));
  }

  return UnitGraphPtr(new UnitGraph(meta_graph(), new_incsr, new_outcsr, new_coo));
}

1604
1605
1606
1607
1608
1609
1610
std::tuple<UnitGraphPtr, IdArray, IdArray>
UnitGraph::ToSimple() const {
  CSRPtr new_incsr = nullptr, new_outcsr = nullptr;
  COOPtr new_coo = nullptr;
  IdArray count;
  IdArray edge_map;

1611
  auto avail_fmt = SelectFormat(all_code);
1612
1613
  switch (avail_fmt) {
    case SparseFormat::kCOO: {
1614
      auto ret = aten::COOToSimple(GetCOO()->adj());
1615
1616
      count = std::get<1>(ret);
      edge_map = std::get<2>(ret);
1617
      new_coo = COOPtr(new COO(meta_graph(), std::get<0>(ret)));
1618
1619
1620
      break;
    }
    case SparseFormat::kCSR: {
1621
      auto ret = aten::CSRToSimple(GetOutCSR()->adj());
1622
1623
      count = std::get<1>(ret);
      edge_map = std::get<2>(ret);
1624
      new_outcsr = CSRPtr(new CSR(meta_graph(), std::get<0>(ret)));
1625
1626
1627
      break;
    }
    case SparseFormat::kCSC: {
1628
      auto ret = aten::CSRToSimple(GetInCSR()->adj());
1629
1630
      count = std::get<1>(ret);
      edge_map = std::get<2>(ret);
1631
      new_incsr = CSRPtr(new CSR(meta_graph(), std::get<0>(ret)));
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
      break;
    }
    default:
      LOG(FATAL) << "At lease one of COO, CSR or CSC adj should exist.";
      break;
  }

  return std::make_tuple(UnitGraphPtr(new UnitGraph(meta_graph(), new_incsr, new_outcsr, new_coo)),
                         count,
                         edge_map);
}

1644
}  // namespace dgl