mohammad-ali96 Goto Github PK

a5-algorithm

A5/1 is a stream cipher used to provide over-the-air communication privacy in the GSM cellular telephone standard

advanced-algorithm

This Repo contains algorithm to find approximate soultion to the following problem: Finding 2-approximate solution for TSP by Christofides Algorithm, Finding approximate solution for Minimum Vertex Cover by liner time algorithm (Simplex) and greedy algprithm, Solving max flow by Ford Fulkerson

bricks

ci-cd-practice

coco-explorer

COCO Common Objects in Context

delta-tsp

Finding an approximate solution for Delta TSP using Christofied Algorithm and Greedy algorithm to find the best matching

dukkantek-login-task

dukkantek-task

flutter-core-project

github-test

knap-sack-problem

This repo contains algorithms to find the best solution for Fractional knapsack problem using greedy algorithm and best solution for 0-1 knapsack using dynamic programing

login-task

max-flow-problem

Finding max flow in weighted graph using FordFulkerson algorithm

mst-restoration

nim-game

Nim is a mathematical game of strategy in which two players take turns removing (or "nimming") objects from distinct heaps or piles. On each turn, a player must remove at least one object, and may remove any number of objects provided they all come from the same heap or pile. Depending on the version being played, the goal of the game is either to avoid taking the last object or to take the last object.

s-t-tsp-path

sample_app

shortest-path-algorithms

This repo contains two algorithms Dijkstra and Bellman Ford to find the shortest path from source vertex

time_tracking_task