An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)

[ICLR 2022] Code for Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation (GLNN)

jgtextrank: Yet another Python implementation of TextRank

unsupervised clustering, generative model, mixed membership stochastic block model, kmeans, spectral clustering, point cloud data

Given network and commodity information this tool computes a feasible multi-commodity flow over time.

Kong is a tool to compute the concurrency relation of a Petri using nets reduction (polyhedral approach).

Graph Isomorphism

This script lists out all paths from inputs to outputs of an input combinational circuit in the form of structural/gate-level modelling in verilog. The BFS graph algorithm is used.

Student-friendly molecular pathway finder — like Google Maps for chemistry. Find step-by-step reaction routes between compounds using JEE/NEET curriculum reactions.

Python wrapper for C++ implementation of Maximal Biclique enumeration algorithm (https://www.sciencedirect.com/science/article/pii/S0166218X04000629)

A simple automatic Wiki-Game on top of Wikispeedia dataset

Finding the shortest path in the graph with Floude's method

Python package to enable testing of the Edge Addition Planarity Suite via the Cython planarity package