BFS and DFS graph traversal in C — adjacency list, Eulerian verification, 72-test suite. Based on Cormen's Introduction to Algorithms Ch. 22. BFS and DFS graph traversal in C — adjacency list, ...
Heterogeneous Graph Transformer is a graph neural network architecture that can deal with large-scale heterogeneous and dynamic graphs. You can see our WWW 2020 paper “Heterogeneous Graph Transformer” ...