Space efficient (graph) algorithms

Z- algorithm for pattern matching, Trie-Aho-Corasick Automaton(FGREP), Hungarian Algorithm for the Munkres Assignment Problem, Binary Lifting, Eulerian Tour for Least Common Ancestor(LCA) using Sparse Table coupled with Farach-Colton and Bender optimization, Wellsh Powell Algorithm for Graph Coloring, Kahn's Agorithm for TopSort and Cycle detect…

Computational Biology Assignments

Dijkstra's, Prim's and Eulerian tour to determine best airline route written in C++

Modeling the Chinese Postman Problem in NetworkX and creating a graphical visualization of the Eulerian path/circuits that appear.

A web tool to build, edit and analyze graphs

Implementing graph theory concepts using networkx library

CSC228 Discrete Mathematical Structures course

3rd sem Discrete Mathematics and Logic assignment on graphs. C Functions to answer the following questions:

Some tasks of Algorithms and Data Structures course.

This project involves implementing an algorithm to solve a graph traversal problem using eulerian circuit finding.

What does the night sky look like in other places in the galaxy?

The phi X 174 bacteriophage is a single-stranded DNA virus that infects Escherichia coli (E. Coli), and the first DNA-based genome to be sequenced. This work was completed by Fred Sanger and his team in 1977. This repository contains simple assembler, different components of it and various error correction techniques for assembling Phi X 174 bac…

It detects either the Graph is a Eulerian Path or a Cycle

Check if there is an Eulerian cycle or path in a graph.

This project proposes a solution for the "Travel Tickets Order" problem and show real examples of object oriented principles and design patterns on PHP.

What I learned from Data Structures and Algorithms Specialization on Coursera.

Data Structures and Algorithms Specialization

A weighted graph data structure capable of doing common algorithms such as dijkstra shoretest path, DFS, BFS, Sollin(Boruvka),Prim MST, Kruskal MST, Eulerian path, Hamiltonian cycle Algorithms and more.

This repository have the implementation of a string reconstructor using Bruijn graphs and eulerian path. This problem is very important in bioinformatics, because it is used to reconstruct the DNA sequence from a set of k-mers.