wardbradt/peregrine 📦

Detects arbitrage opportunities across 131 cryptocurrency exchanges in 50 countries

Language: Python - Size: 3.84 MB - Last synced at: 8 months ago - Pushed at: about 4 years ago - Stars: 1,221 - Forks: 339

TrainingByPackt/CPP-Data-Structures-and-Algorithm-Design-Principles

Leverage the power of modern C++ to build robust and scalable applications

Language: C++ - Size: 3.56 MB - Last synced at: about 15 hours ago - Pushed at: almost 5 years ago - Stars: 73 - Forks: 39

SvenWoltmann/pathfinding

Source code for the HappyCoders.eu articles on pathfinding and shortest path algorithms (Dijkstra, A*, Bellman-Ford, Floyd-Warshall).

Language: Java - Size: 962 KB - Last synced at: about 13 hours ago - Pushed at: about 15 hours ago - Stars: 39 - Forks: 24

andreaiacono/GraphLab

GraphLab is an application that shows visually how several graph algorithms work

Language: Java - Size: 140 KB - Last synced at: almost 2 years ago - Pushed at: over 8 years ago - Stars: 31 - Forks: 8

lewismj/purely_functional_graph_algos

Library for functional graph & geometry algorithms

Language: Scala - Size: 2.89 MB - Last synced at: 4 months ago - Pushed at: over 6 years ago - Stars: 21 - Forks: 2

shah-deep/Graph-Theory-Algos

Graph Theory algorithms: Vertex Coloring, Bellman-Ford, Dijkstra's, Hopcroft-Karp, Prim's, Topological Sorting, Floyd-Warshall

Language: Python - Size: 22.5 KB - Last synced at: over 2 years ago - Pushed at: about 4 years ago - Stars: 15 - Forks: 3

gkonovalov/algorithms

Algorithms and Data Structures a comprehensive collection of fundamental Algorithms and Data structures organized into various categories to cater to the needs of software engineers and computer science students.

Language: Java - Size: 860 KB - Last synced at: 3 months ago - Pushed at: 8 months ago - Stars: 9 - Forks: 2

Ledmington/bellman-ford-cuda

CUDA implementation of the Bellman-Ford's algorithm.

Language: Cuda - Size: 32 MB - Last synced at: 11 months ago - Pushed at: 11 months ago - Stars: 8 - Forks: 0

guhhhhaa/bfm-unity-gitbook

BFM Unity (https://www.bfm-unity.com/) (https://guhhhhaa.gitbook.io/bfm/) is neutral politically, economically and worldwide. It is a decentralized financial and economic continuum of dissipative structure clusters, formed by distributed self-organization of modular units of microeconomic structures driven by intelligent algorithms.

Size: 968 MB - Last synced at: 4 months ago - Pushed at: 4 months ago - Stars: 7 - Forks: 12

deprekate/fastpath

A program to find the path through a network of nodes.

Language: C - Size: 216 KB - Last synced at: 3 days ago - Pushed at: 11 months ago - Stars: 7 - Forks: 2

arnab132/Bellman-Ford-Algorithm-Python

Bellman Ford Algorithm Implementation using Python

Language: Python - Size: 81.1 KB - Last synced at: almost 2 years ago - Pushed at: almost 2 years ago - Stars: 7 - Forks: 0

aafulei/parallel-bellman-ford

Parallel implementations of Bellman-Ford algorithm with MPI, OpenMP and CUDA.

Language: C++ - Size: 11.7 KB - Last synced at: over 2 years ago - Pushed at: almost 7 years ago - Stars: 7 - Forks: 2

dedeco/dijkstra-bellman-ford

Algoritmo de Dijkstra e algoritmo Bellman-ford que resolve o problema dos caminhos mínimos (python)

Language: Python - Size: 101 KB - Last synced at: over 1 year ago - Pushed at: about 8 years ago - Stars: 6 - Forks: 5

SamanKhamesian/Algorithms-Implementation

This repository will hold source codes for different classic algorithms in computer science

Language: C++ - Size: 22.5 KB - Last synced at: 5 months ago - Pushed at: over 6 years ago - Stars: 5 - Forks: 1

wOvOpy/GraphAlgorithm

Several classical algorithms in graph theory, using NetworkX to simply visualize results.

Language: Python - Size: 563 KB - Last synced at: over 2 years ago - Pushed at: over 3 years ago - Stars: 4 - Forks: 1

hienmv/Problems-Solving

My implementation of useful data structures, algorithms, as well as my solutions to programming puzzles.

Language: Java - Size: 1.13 MB - Last synced at: over 2 years ago - Pushed at: over 4 years ago - Stars: 4 - Forks: 0

ingokuba/treespanner

:deciduous_tree: Simulation of a spanning tree protocol

Language: Java - Size: 35.2 KB - Last synced at: over 2 years ago - Pushed at: about 6 years ago - Stars: 3 - Forks: 0

teodutu/PA

Proiectarea Algoritmilor - UPB 2019

Language: C++ - Size: 61.4 MB - Last synced at: about 2 months ago - Pushed at: about 6 years ago - Stars: 3 - Forks: 1

Stratadox/Pathfinder

A motion planning solution for PHP.

Language: PHP - Size: 131 KB - Last synced at: about 1 month ago - Pushed at: over 6 years ago - Stars: 3 - Forks: 0

chandansgowda/jssstu-cn-lab

JSSSTU Computer Networks Lab

Language: Python - Size: 22.5 KB - Last synced at: over 1 year ago - Pushed at: about 2 years ago - Stars: 2 - Forks: 1

danielzhangau/Advanced-Algorithms-Data-Structures

Analysis of algorithms. The solution of summation & recurrence equations. Algorithm paradigms: divide-&-conquer, greedy algorithms, dynamic programming, backtracking, branch-&-bound. Advanced graph algorithms. Amortised analysis. Self-adjusting data structures. Complexity classes, NP-completeness. Approximation algorithms. Randomized algorithms.

Language: Java - Size: 37 MB - Last synced at: about 2 years ago - Pushed at: over 2 years ago - Stars: 2 - Forks: 0

adriancalavie/Luxembourg

Luxembourg map traversal in Java using Dijkstra's and Bellam Ford algorithms

Language: Java - Size: 1.24 MB - Last synced at: over 2 years ago - Pushed at: over 2 years ago - Stars: 2 - Forks: 0

Nalhin/Navigation

🛰️ Real-world navigation based on open source spatial data and pathfinding algorithms

Language: Java - Size: 148 MB - Last synced at: over 2 years ago - Pushed at: about 4 years ago - Stars: 2 - Forks: 0

danielbergholz/routing-algorithms-python

Famous routing algorithms implemented in python 2 using the igraph library

Language: Python - Size: 30.3 KB - Last synced at: 5 days ago - Pushed at: about 6 years ago - Stars: 2 - Forks: 0

jhomswk/Shortest_Paths

Python implementation of single-source and all-pairs shortest paths algorithms.

Language: Python - Size: 2.93 KB - Last synced at: 8 months ago - Pushed at: over 6 years ago - Stars: 2 - Forks: 1

dileep-kishore/CombOpt.jl

Combinatorial Optimization and Graph Algorithms in Julia

Language: Julia - Size: 1.07 MB - Last synced at: over 2 years ago - Pushed at: almost 7 years ago - Stars: 2 - Forks: 0

Esthaor/Graph-critical-path

Finding critical path on large graph using Bellman-Ford algorithm with parallel implementations

Language: C++ - Size: 1.98 MB - Last synced at: over 2 years ago - Pushed at: over 7 years ago - Stars: 2 - Forks: 4

wlxiong/k_shortest_bus_routes

A k-shortest routes algorithm for urban public transportation network

Language: C++ - Size: 211 KB - Last synced at: over 2 years ago - Pushed at: about 12 years ago - Stars: 2 - Forks: 0

duartebranco/ProjGraphAED

Graph Algorithms Project

Language: C - Size: 680 KB - Last synced at: 6 months ago - Pushed at: 7 months ago - Stars: 1 - Forks: 0

slavik-pastushenko/graph-algorithms-rs

A collection of graph algorithms in Rust.

Language: Rust - Size: 44.9 KB - Last synced at: about 1 month ago - Pushed at: 8 months ago - Stars: 1 - Forks: 0

RyanAlbertson/Algorithm_Visualizer

Graph search, shortest path , and MST algorithm visualizing software.

Language: Java - Size: 178 MB - Last synced at: almost 2 years ago - Pushed at: almost 2 years ago - Stars: 1 - Forks: 0

genndy007/bellman_ford_rethink

Implementation of Bellman Ford Parallel and Sequential Algorithm with Java and Maven. Rethinked. Coursework for 6 semester.

Language: Java - Size: 1.37 MB - Last synced at: 6 months ago - Pushed at: about 3 years ago - Stars: 1 - Forks: 0

cedoor/network-flow-algorithms

TypeScript implementation of some network flow algorithms.

Language: TypeScript - Size: 373 KB - Last synced at: 26 days ago - Pushed at: over 4 years ago - Stars: 1 - Forks: 0

kagrze/pyalgo

Python implementations of fundamental algorithms and data structures

Language: Python - Size: 18.6 KB - Last synced at: about 2 years ago - Pushed at: almost 5 years ago - Stars: 1 - Forks: 0

mithie/algorithm-bellman-ford

Bellman-Ford algorithm in Python

Language: Python - Size: 28.3 KB - Last synced at: over 2 years ago - Pushed at: over 5 years ago - Stars: 1 - Forks: 0

AshkanAbd/Search_Algorithms

implementation of search algorithms

Language: Java - Size: 30.3 KB - Last synced at: 5 months ago - Pushed at: over 6 years ago - Stars: 1 - Forks: 0

pedrogongora/MTBDD-Prototype

Prototype C++ implementations of multi-terminal BDD node-table and symbolic Bellman-Ford for graph games

Language: C++ - Size: 473 KB - Last synced at: almost 2 years ago - Pushed at: about 7 years ago - Stars: 1 - Forks: 0

JasontheMonster/Shortest-Path-Algorithm-Comparison

Implementation of Bellman-Ford and Dijkstra with Java

Language: Python - Size: 31.8 MB - Last synced at: over 2 years ago - Pushed at: almost 8 years ago - Stars: 1 - Forks: 0

SleekPanther/bellman-ford

Shortest Paths from every vertex to a goal vertex allowing negative-weight edges (when Dijkstra's fails)

Language: Java - Size: 820 KB - Last synced at: 6 months ago - Pushed at: over 8 years ago - Stars: 1 - Forks: 0

wlxiong/kshortest

A k-shortest routes algorithm (implemented in MATLAB)

Language: Matlab - Size: 117 KB - Last synced at: over 2 years ago - Pushed at: about 10 years ago - Stars: 1 - Forks: 0

laertispappas/bellman-ford-dijkstra

Bellman ford & Dijkstra algorithm - draft

Language: C - Size: 141 KB - Last synced at: 2 months ago - Pushed at: over 10 years ago - Stars: 1 - Forks: 0

theBappy/top-asked-dsa-problem-solving

data structure and algorith:This journey is not just about coding but also about developing problem-solving thinking, optimizing solutions, and building a strong foundation for coding interviews and real-world programming. So far i am loving it.

Language: Python - Size: 204 KB - Last synced at: 2 days ago - Pushed at: 2 days ago - Stars: 0 - Forks: 0

R-Anurag/Pathfinding-Visualizer

Interactive Visualization of Pathfinding Algorithms (BFS, DFS, Bellman-Ford, Dijkstra, A*) on Bangalore’s Road Network.

Language: Python - Size: 44 MB - Last synced at: 11 days ago - Pushed at: 12 days ago - Stars: 0 - Forks: 0

debora-oliv/Grafos-Transporte-Eficiente

Implementação e comparação de algoritmos (Dijkstra e Bellman-Ford) aplicados a eficiência do transporte público.

Language: Python - Size: 499 KB - Last synced at: 15 days ago - Pushed at: 15 days ago - Stars: 0 - Forks: 1

simpsonresearch/tsinghua_benchmarks

Tinsguhua, Dijkstra, Bellman-Ford Benchmarks 2025

Language: Python - Size: 35.2 KB - Last synced at: 3 days ago - Pushed at: 24 days ago - Stars: 0 - Forks: 0

Ite-2022-pwr/AiZO

Algorytmy i złożoność obliczeniowa - projekty

Size: 4.88 KB - Last synced at: about 2 months ago - Pushed at: about 2 months ago - Stars: 0 - Forks: 0

WilliamZhang20/Stochastic-Control

Optimal control concepts, applied in code

Language: Julia - Size: 225 KB - Last synced at: 2 months ago - Pushed at: 3 months ago - Stars: 0 - Forks: 0

mmsaki/defigraph

፨ A python package for analyzing Uniswap token tools as a graph

Language: Python - Size: 3.97 MB - Last synced at: 5 days ago - Pushed at: 4 months ago - Stars: 0 - Forks: 0

luisegarduno/Various-ShortestPath-Algorithms

Explore several shortest-path algorithms using this all-for-one program!

Language: C++ - Size: 591 KB - Last synced at: 4 months ago - Pushed at: 4 months ago - Stars: 0 - Forks: 0

runeksvendsen/bellman-ford

Haskell translation of Sedgewick & Wayne's Bellman-Ford implementation

Language: Haskell - Size: 490 KB - Last synced at: 2 days ago - Pushed at: 5 months ago - Stars: 0 - Forks: 0

vitorpbarbosa7/mit_6.006

MIT - 6.006 - Undergraduate Introduction to Algorithms - Spring 2020

Language: Python - Size: 4.35 MB - Last synced at: 5 months ago - Pushed at: 5 months ago - Stars: 0 - Forks: 0

B-E-D-A/SD-HW-

Библиотека на C++ для решения задач поиска кратчайших путей в графах. Включает реализацию популярных алгоритмов, таких как поиск в ширину (BFS), алгоритм Дейкстры, алгоритм Беллмана-Форда, алгоритм A* (A-star), алгоритм Флойда-Уоршалла и алгоритм Джонсона.

Size: 1.09 MB - Last synced at: 5 months ago - Pushed at: 5 months ago - Stars: 0 - Forks: 1

ArseniiStratiuk/Decision-Tree-Classifier-Lab

A student lab project focused on tree algorithms and a Decision Tree classifier.

Language: Jupyter Notebook - Size: 2.32 MB - Last synced at: 3 months ago - Pushed at: 7 months ago - Stars: 0 - Forks: 1

ZanissNguyen/BellmanFord_TravelingSaleMan_k232

A School assignment for discrete mathematic course

Language: C++ - Size: 0 Bytes - Last synced at: 8 months ago - Pushed at: 8 months ago - Stars: 0 - Forks: 0

MatiasCarabella/graph-matrix-pathfinder

Set of tools for graph manipulation and analysis, including pathfinding algorithms and cycle detection.

Language: Java - Size: 11.7 KB - Last synced at: 16 days ago - Pushed at: 9 months ago - Stars: 0 - Forks: 0

mdshohed/Graph-theory

I have added graph's all part in this file

Language: C++ - Size: 95.7 KB - Last synced at: 10 months ago - Pushed at: 10 months ago - Stars: 0 - Forks: 0

ChrisTs8920/shortest-path-algorithms

An implementation and analysis of 3 shortest path algorithms with Python.

Language: Python - Size: 57.6 KB - Last synced at: 6 months ago - Pushed at: about 1 year ago - Stars: 0 - Forks: 0

d4ve10/Bellman-Ford-GTFS

A project to find the shortest path in a GTFS dataset using the Bellman-Ford algorithm

Language: Jupyter Notebook - Size: 1.32 MB - Last synced at: 3 months ago - Pushed at: about 1 year ago - Stars: 0 - Forks: 0

mkanetsuna/rust-bellman-ford

Language: Rust - Size: 5.02 MB - Last synced at: about 1 year ago - Pushed at: about 1 year ago - Stars: 0 - Forks: 0

MaoucheMounir/Projet-MOGPL-Optimisation_Bellman-Ford

Accélération de la convergence de l'algorithme de Bellman-Ford via des permutations de violation minimales

Language: Jupyter Notebook - Size: 865 KB - Last synced at: 12 months ago - Pushed at: over 1 year ago - Stars: 0 - Forks: 0

Anoushka21/CUDA-vs-OpenMP

Comprehensive comparitive analysis of CUDA & OpenMP | Final Project for NYU-CSCI-GA.3033-025: Graphical Processing Units

Language: C++ - Size: 501 KB - Last synced at: over 1 year ago - Pushed at: over 1 year ago - Stars: 0 - Forks: 0

AlWo223/Optimisation-Algo

Solutions for various Kattis programming challenges about optimisation algorithms

Language: Python - Size: 28.9 MB - Last synced at: over 1 year ago - Pushed at: over 1 year ago - Stars: 0 - Forks: 0

MatyasUrban/ShortestPathfinder

Language: C++ - Size: 1.02 MB - Last synced at: over 1 year ago - Pushed at: over 1 year ago - Stars: 0 - Forks: 0

Awinja-j/dynamic-programming-with-python

This repo contains solutions to problems solved using dynamic programming with python.

Language: Python - Size: 25.4 KB - Last synced at: almost 2 years ago - Pushed at: almost 2 years ago - Stars: 0 - Forks: 0

mahmed-eng/Bellman-ford-Algorithm

The Bellman-Ford algorithm is a graph search algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph en.wikipedia.org cp-algorithms.com. It is more versatile than Dijkstra's algorithm as it is capable of handling graphs in which some of the edge weights are negative numbers.

Language: HTML - Size: 4.88 KB - Last synced at: about 2 years ago - Pushed at: about 2 years ago - Stars: 0 - Forks: 0

Bictole/EulerianSnowscape

Use of graph theory to optimize snow removal routes in Montreal and finding an optimal drone flight path to cover all streets in a city. Process of making a graph Eulerian and the use of Edmond-Karp and Bellman-Ford algorithms.

Language: Python - Size: 397 KB - Last synced at: about 2 years ago - Pushed at: about 2 years ago - Stars: 0 - Forks: 0

MAOMislive/BellmanFord-Algorithm

SSSP stands for Single-Source Shortest Path. This Bellman Ford algorithm is used to obtain optimal solution for SSSP problem. I have used Java prog. language to implement this algorithm.

Language: Java - Size: 1.95 KB - Last synced at: over 2 years ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

emikodes/Grafi-Alberi-Algoritmi-Implementazione-C

Guida completa ai grafi e agli alberi, con visite, algoritmi di ricerca dei percorsi minimi, e codice per l'implementazione di alberi binari / ABR (BST) in linguaggio C.

Size: 1.36 MB - Last synced at: 3 months ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

mankotia412vishal/Shortest-path-finder

Dijkstra alogrithm , Bellman ford, Floyd Warshall algorithm

Language: C - Size: 12.7 KB - Last synced at: over 1 year ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

projeto-de-algoritmos/Final_Voos

O melhor site para encontrar passagens baratas é aqui!

Language: JavaScript - Size: 13.2 MB - Last synced at: over 1 year ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

laravitoriabarros/theory_of_graphs Fork of rena02to/graph_theory_assessment

Project made to obtain a grade for av2 in the subject of graph theory at UFAL in the computer science course

Language: C++ - Size: 75.2 KB - Last synced at: over 2 years ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

AnthonyMazzie/BellmanFord

Given a directed, weighted graph containing positive and negative edge weights, a source node and destination node, this Java application utilizes the Bellman Ford algorithm to return the shortest path and distance from source to destination.

Language: Java - Size: 157 KB - Last synced at: 2 months ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0

rang21c/Shortest-Path-Navigation-Program

2020-2학기 Data Structure 프로젝트

Language: C++ - Size: 3.25 MB - Last synced at: over 2 years ago - Pushed at: about 3 years ago - Stars: 0 - Forks: 0

seunghee73/may-algo-study

:pencil:5월 알고리즘 스터디

Language: Python - Size: 279 KB - Last synced at: about 2 years ago - Pushed at: over 3 years ago - Stars: 0 - Forks: 5

MBadriNarayanan/AdvancedDataStructuresLab 📦

Advanced Data Structures Lab work done during IV Semester

Language: C++ - Size: 15.6 MB - Last synced at: over 2 years ago - Pushed at: almost 4 years ago - Stars: 0 - Forks: 0

arjunsawhney1/graph-algorithms

In this repo, I modify different graph algorithms and explore implementations of Breadth First Search, Depth First Search, and Bellman Ford.

Language: Python - Size: 8.79 KB - Last synced at: about 2 years ago - Pushed at: almost 4 years ago - Stars: 0 - Forks: 0

mbhdra/Shortest-Path

3 shortest path algorithms' implementations (Dijkstra, Bellman-Ford, Floyd-Warshall) for the graphs in the plain text DIMACS Challenge format and their run time analysis.

Language: Java - Size: 12.3 MB - Last synced at: over 2 years ago - Pushed at: about 4 years ago - Stars: 0 - Forks: 0

haimadrian/InternetProgramming-GraphAlgorithms

Repository for Internet Programming course - Implementing parallel graph algorithms, such as BFS, DFS, Dijkstra and Bellman-Ford

Language: Java - Size: 1.8 MB - Last synced at: over 2 years ago - Pushed at: about 4 years ago - Stars: 0 - Forks: 1

ArturRejment/graph-algorithm

Implementation of MST algorithm (Prim and Kruskal) and shortest path algorithm (Dijkstra and Bellman-Ford)

Language: C++ - Size: 34.2 KB - Last synced at: over 2 years ago - Pushed at: about 4 years ago - Stars: 0 - Forks: 0

daviddavo/bellman-ford-haskell

Bellman-Ford implementation on haskell using monads. Mirror from GitLab.

Language: TeX - Size: 43 KB - Last synced at: 6 months ago - Pushed at: over 4 years ago - Stars: 0 - Forks: 0

TomekGniazdowski/bellman-ford-algorithm

Language: C++ - Size: 1.18 MB - Last synced at: over 2 years ago - Pushed at: over 4 years ago - Stars: 0 - Forks: 0

marinmaslov/computer-networks-algorithms

Computer Networks Course @ FESB, University of Split

Language: Python - Size: 8.79 KB - Last synced at: over 2 years ago - Pushed at: over 4 years ago - Stars: 0 - Forks: 0

etrian-dev/spt

Algorithm that solves the SPT problem on a graph G = (N, A)

Language: C - Size: 57.1 MB - Last synced at: over 2 years ago - Pushed at: over 4 years ago - Stars: 0 - Forks: 0

abcs-ab/Algorithms

Bunch of algorithms implemented in Python.

Language: Python - Size: 179 KB - Last synced at: over 2 years ago - Pushed at: over 5 years ago - Stars: 0 - Forks: 1

hugosousa111/caminhos_minimos-fluxo_maximo-grafos

Problema dos caminhos mínimos e fluxo máximo

Language: Python - Size: 720 KB - Last synced at: over 2 years ago - Pushed at: over 5 years ago - Stars: 0 - Forks: 0

Vishnu44d/graph_algorithms

Graph algorithms in c

Language: C - Size: 95.7 KB - Last synced at: over 2 years ago - Pushed at: almost 6 years ago - Stars: 0 - Forks: 0

krplata/graphs 📦

Shortest Path Tree and Minimum Spanning Tree algorithms for graphs.

Language: C++ - Size: 76.2 KB - Last synced at: about 1 year ago - Pushed at: almost 7 years ago - Stars: 0 - Forks: 0

aniketp/Graph-Theory

Graph Theory project by Stamatics

Language: TeX - Size: 1.1 MB - Last synced at: over 2 years ago - Pushed at: about 7 years ago - Stars: 0 - Forks: 0

HelloLeexy/Routing-Protocol Fork of saleemnust/Routing-Protocol

Problem statement We have to implement the distance-vector (Bellman Ford) routing protocol using Python as the programming language. We are provided with the topology map in the form of configuration files. Each router must only know the costs to reach its direct neighbors and the cost it takes to reach other routers from any given neighbor. The routers must not have global knowledge. Upon initialization, each router creates a distance-vector update packet and sends this packet to all direct neighbors. Upon receiving this distance-vector update packet, each neighboring router will incorporate the provided information into its routing table. Each router should periodically broadcast the distance-vector update packet to its neighbors every 10 seconds. Approach used Multithreading Distance vector routing protocol(Bellman Ford) Socket programming Simulated network(localhost) Simulated network: Since, we are not provided any access to real network routers (for implementation and testing of your programs), we used a simulated network that was running on a single desktop machine (localhost). Multithreading: We have used multithreading in our project in which a single set of code can be used by several processors at different stages of execution. There are two threads in our project. One is for the client status and the other is for the server which will run forever until the router exists. Socket programming: Python provides two levels of access to network services. At a low level, we can access the basic socket support in the underlying operating system, which allow to implement clients and servers for both connection-oriented and connectionless protocols. In our Project we use Connectionless protocol which is UDP (User Datagram Protocol).In our program client and server are implemented together in a same file and we are accessing server name, port number and config filename from command line arguments. Data structure used: For the communication of data between client and the server python dictionaries have been used which are editable later on. We are reading the file and then storing it in a dictionary. To send this data json has been used. Distance vector routing protocol(Bellman Ford): In distance vector routing algorithm distance vector is passed to calculate the minimum cost from one node to the other nodes. Distance vector is actually a dictionary which contains the data about neighbors and their distances from other neighbouring nodes. Bellman runs only if the update vector comes and update vector comes only when the cost changes. Checking an active host: To check whether a host is running or not we have implemented the active host function. This function returns whether a host is active or not. The purpose was to check regularly the active hosts and the closed hosts. Problems Faced: We faced many problem in the implementation of the Bellman Ford algorithm regarding to its calculations and also we still haven't implemented the link down problem solution.

Size: 3.91 KB - Last synced at: about 2 years ago - Pushed at: about 7 years ago - Stars: 0 - Forks: 0

maurodelazeri/Bellman-Ford

Bellman-Ford implementation

Language: Go - Size: 3.91 KB - Last synced at: 6 months ago - Pushed at: over 7 years ago - Stars: 0 - Forks: 1

rikkt0r/agh-algorithms-and-data-structures 📦

2016, AGH-UST Applied Computer Science, Algorithms and Data Structures course

Language: C++ - Size: 75.2 KB - Last synced at: 12 months ago - Pushed at: almost 8 years ago - Stars: 0 - Forks: 0