An experiment in scalable routing as an encrypted IPv6 overlay network

🧨 Generates Cisco scripts based on YAML files

Multiple / Rapid Spanning Tree Library & Windows Simulator

Implementations of different algorithms for building Euclidean minimum spanning tree in k-dimensional space.

Leveraging Recursive Gumbel-Max Trick for Approximate Inference in Combinatorial Spaces, NeurIPS 2021

Research on TSN (Time-Sensitive Networking) Industrial IoT Multicast

Programmed Eulerian Routing for DNA Design using X-overs

🧭⚡ Implementation of path-finding algorithms in an availability grid. ( binary matrix )

A Python application that simulates the spanning tree algorithm used to prevent loops in an Ethernet switched network.

Famous routing algorithms implemented in python 2 using the igraph library

This project is for calculating minimum cost of spanning tree whose edge costs changes according to time equation.It calculates Time T, for which Minimum spanning tree cost is least in all time instances.

The GNS3-Network-Lab is meant to provide a complete educational experience in Cisco networking.

Biblioteca sobre o Algoritmo de Kruskal implementado em C++

Maze generator and solver with Kruskal algorithm (Sapnning Tree).

Solution implementation of HackerRank, LeetCode, Codeforces, SPOJ, and UVA problems.

This repository contains my solutions for the Graph Theory Assignments course at Federal Institute of Education, Science and Technology of Paraíba The course covers various topics in graph theory, including graph representations and graph algorithms.

Minimum Degree Spanning Tree

comput minimum spanning tree in a weighted graph

Some drafts of miscellaneous codes.