Algorithm Practice

Assignments from Algorithms Course like - All pairs shortest path, Common Substrings, Huffman Coding, K-nary Heaps, KMP, Line Sweep, Matrix Chain Multiplication, Maximum Flow, Quick Sort, Strongly Connected Components

Application of Breadth-First Search to see if a directed graph is Strongly Connected

Discussion on Strongly connected components

Esercizio per laboratorio di Algoritmi - 2017

Graph algorithms in lua

Implementação de algoritmos de grafos em python

Strongly connected components in a Graph

Primeiro projecto de Análise e Síntese de Algoritmos em C++. Uma cadeia de supermercados

Implementation of Tarjan, Nuutila and Pearce algorithms for strongly connected components using C++ Boost Library.

Implementation of the algorithm to find strongly connected components of a directed graph

Implementation of an Algorithm to find Diameter of a Tree (represented as a Graph) using BFS, to find Odd-Length Cycle in a Tree. Implementation of Enumeration of all Paths in a connected Graph, and Enumeration of all permutation with alternate parities.

Implementation of DFS - strongly connected components on a Directed Graph, using same Object Oriented approach from SP08. Implementation of two versions of partition algorithms of Quick Sort and their comparison. Implementation of Dual-Pivot Quick Sort Algorithm.

Programming assignments of the Algorithms and Data structures course • University project • 2016 - Algorithms and data structures - BSc in Physics, III year

Finding strongly connected components in graphs

Selected Graph Algorithms

PPar Metrics tool. Uses LLVM framework to build a dependence graph of a program and calculates a set of software parallelisability metrics.