Simple but powerful graph library for Rust
-
Updated
Jan 14, 2023 - Rust
#
graph-algorithm
Here are 76 public repositories matching this topic...
An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)
deep-learning community-detection motif deepwalk networkx louvain igraph network-embedding graph-partitioning gcn graph-clustering node2vec graph-embedding graph-algorithm graph2vec gemsec gnn network-motif graph-motif graph-deco
-
Updated
Nov 6, 2022 - Python
[ICLR 2022] Code for Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation (GLNN)
deep-learning scalability pytorch knowledge-distillation efficient-inference distillation graph-algorithm graph-neural-networks gnn
-
Updated
Oct 22, 2024 - Python
Nebula-Algorithm is a Spark Application based on GraphX, which enables state of art Graph Algorithms to run on top of NebulaGraph and write back results to NebulaGraph.
-
Updated
Aug 19, 2024 - Scala
[ICLR 2023] MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initialization
deep-learning scalability pytorch feedforward-neural-network multi-layer-perceptron graph-algorithm graph-neural-networks gnn efficient-training
-
Updated
Apr 5, 2023 - Jupyter Notebook
A curated list of graph learning papers, articles, tutorials, slides and projects
-
Updated
Sep 29, 2020
Genetic Algorithm for the Maximum Clique Problem
-
Updated
Aug 25, 2020 - C++
Block-style programming environment for tackling graph structure and graph algorithm, based on MIT Scratch.
-
Updated
Aug 7, 2026 - Smalltalk
OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP.
open-source openmp pagerank dfs graph-processing opengraph spmv breadth-first-search depth-first-search betweenness-centrality triangle-counting bellmanford graph-framework connected-components bfs-algorithm delta-stepping graph-algorithm sssp opengraph-benchmark-suite sparse-matrix-vector-multiplication
-
Updated
Apr 27, 2024 - C
jgtextrank: Yet another Python implementation of TextRank
nlp machine-learning text-mining parsing textrank feature-extraction computational-linguistics text-analytics term-extraction keyphrases graph-algorithm natural-naturallanguage-processing keywords-extraction text-summarisation
-
Updated
Nov 27, 2019 - Python
Jet: Graph Partitioner for GPU
-
Updated
May 13, 2025 - C++
VeloGraphX is a high-performance C++20 engine for exact analytics on evolving graphs, combining mutable graph storage, adaptive incremental repair vs. recomputation, multicore CPU execution, and reproducible benchmarking across dynamic BFS, SSSP, connected components, triangles, k-core, and PageRank.
cpp parallel-computing high-performance-computing graph-processing graph-analytics multicore cpp20 graph-algorithm incremental-computing dynamic-graphs
-
Updated
Sep 3, 2026 - C++
unsupervised clustering, generative model, mixed membership stochastic block model, kmeans, spectral clustering, point cloud data
graph-theory spectral-clustering spectral-clustering-algorithm graph-algorithm node-classification mmsbm generative-data mixed-membership-stochastic-block
-
Updated
Mar 16, 2020 - Python
An algorithm to look for maximum "edge" biclique
-
Updated
Oct 22, 2021 - C
An SQL storage implementation for graph data structures.
-
Updated
Jul 18, 2023 - Go
A library to simulate DFAs and Probabilistic DFAs using context switching. This library provides a way to build and define the behavior of a graph. The client is able to define the function each vertex and edge of the graph make and how the graph transitions from one (the first valid edge) or to many states, as well as which states the graph sta…
c windows unix json bison flex graph graphs context pthreads graph-theory threading dfa function-pointers dfa-designer graph-algorithm dfa-simulator probabilistic-dfas graph-transitions
-
Updated
Mar 28, 2021 - C
Graph Processing Framework that supports || OpenMP || CAPI
accelerator pagerank dfs benchmarking-suite ibm systemverilog bfs spmv capi betweenness-centrality triangle-counting graph-framework fgpa connected-components graph-algorithm altera-fpga sssp ibm-capi accelgraph-capi opencapi
-
Updated
Aug 20, 2026 - SystemVerilog
Given network and commodity information this tool computes a feasible multi-commodity flow over time.
-
Updated
Feb 5, 2024 - Python
Kong is a tool to compute the concurrency relation of a Petri using nets reduction (polyhedral approach).
-
Updated
Oct 20, 2023 - Python
Add this topic to your repo
To associate your repository with the graph-algorithm topic, visit your repo's landing page and select "manage topics."