Pull requests help you collaborate on code with other people. As pull requests are created, they’ll appear here in a searchable and filterable list. To get started, you should create a pull request.

Implement Dijkstra’s Algorithm in Dart to find the shortest path from a source node to all other nodes in a weighted graph. Use a Priority Queue (Min-Heap) to optimize the performance to O((V + E) log ...

Abstract: Broad learning system (BLS) is an effective neural network requiring no deep architecture, however it is somehow fragile to noisy data. The previous robust broad models directly map features ...

Abstract: In the field of graph self-supervised learning (GSSL), graph autoencoders and graph contrastive learning are two mainstream methods. Graph autoencoders aim to learn representations by ...