Demonstrates Kruskal's and Prim's algorithms to compute the minimum spanning trees for acyclic, connected graphs with different edge sizes and compares and visualizes the running time of these algorithms

Network Analysis in Python

Automated and Connected Transportation (ACT) Vertically Integrated Project (VIP)

Next generation distributed, event-driven, parallel config management!

Extensive learning notes on mathematics

The agda-unimath library

Solutions to problems of LeetCode OJ written in C++, with some hints/explanations

A high performance Python graph library implemented in Rust.

A distributed blossom algorithm for minimum-weight perfect matching

A high-performance library for graph algorithms written in Java. It contains a wide collection of optimized algorithms and data structures for a range of problems on graphs.

Graph theory (network) library for visualisation and analysis

First project of the Applied Graph Theory course, exploring some initial concepts about graphs

Library for the analysis of networks

🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin

Essential tool for graph theory; draw graphs with loops and edges easily. Also known as a graph theorists sketchpad.

Interactive network visualization in Python and Dash, powered by Cytoscape.js

Blazingly fast, vectorised, parallel, and scalable temporal graph engine for Rust, Python and JavaScript

Active Directory ACL Visualizer and Explorer - who's really Domain Admin? (Commerical versions available from NetSection)

SPAtial GrapHs: nETworks, Topology, & Inference

The main goal of this software is to give assistance to Graph Theory and Spectral Graph Theory researchers to establish or refute conjectures quickly and simply, providing for visualization a filtered list of graphs according to the properties given by the user.

Implementation of the Simulated Annealing (SA) algorithm to tactically solve the Traveling. The project involves constructing an adjacency matrix to model inter-city distances, iteratively refining solutions through stochastic alterations influenced by a dynamically adjusted temperature parameter, and employing the Metropolis acceptance criterion.

Python program to benchmark quantum annealed solutions of the travelling salesman problem against classical bruteforce and heuristic methods.

igraph R package

Python library for GraphBLAS: high-performance sparse linear algebra for scalable graph analytics

Distributed Graph Database Server

Python interface for igraph

A collection of algorithms and data structures

BRAPH 2.0 is a comprehensive software package for the analysis and visualization of brain connectivity data, offering flexible customization, rich visualization capabilities, and a platform for collaboration in neuroscience research.

Intelligent help system for Discrete Math

This repository implements the Karger's Algorithm to find the minimum cut for a given graph.