Dart implementation of a directed graph. Provides algorithms for sorting vertices, retrieving a topological ordering or detecting cycles.

[ACM Computing Surveys'23] Implementations or refactor of some temporal link prediction/dynamic link prediction methods and summary of related open resources for survey paper "Temporal Link Prediction: A Unified Framework, Taxonomy, and Review" which has been accepted by ACM Computing Surveys.

Simple weighted graphs. Requires LightGraphs.jl.

A set of efficient data structures in C, created in a generic way

Weighted and unweighted graphs and digraphs with C++

A LightGraphs.jl compatible graph package for graphs with multiple vertex, edge and graph metadata.

PathQuick is a high-performance software solution designed to calculate the quickest path between two landmarks in the United States.

Python package for the visualization of food webs (trophic networks)

[TKDE'23] Demo code of the paper entitled "High-Quality Temporal Link Prediction for Weighted Dynamic Graphs via Inductive Embedding Aggregation", which has been accepted by IEEE TKDE

Node embedding for directed, weighted networks

gene-set clustering and network visualization

Minimal Cycle Basis calculation for Weighted Undirected Graphs (greedy approach)

The Floyd–Warshall algorithm finds the shortest paths (and distances) in a directed weighted graph

Ant colony optimization algorithm simulation with visualization.

Seminar paper (@ Technical University Munich) on parameter free clustering of weighted graphs using PaCCo (Parameter-free Clustering by Coding costs)

Extended Modularity (EQ) for communities in Python

A Java-based project that visualizes a traffic management system using graph structures and JavaFX. It demonstrates node and edge representation for traffic flow between locations, providing an interactive and visual approach to understanding connectivity.

Weighted Directed Graphs - Assignment

Calculate the longest path in a directed acyclic graph in terms of node weights (Python)

A CFG is known as a Single Entry Single Exit (SESE) graph if it only has a single entry node and a single exit node. A problem that arose during researchon static analysis is how to deal with loops in the CFG.