NYCU Physical Design Automation

String re-construction using the concepts of de Bruijn graph and Eulerian path.

A graph header file implementing graph algorithms.

Distance Finding Algorithms

Solution of problem 90 of project Euler in Racket

Graph Theory in computer Application. Features of Graph Theory project are: Bipartile, Planner, Tree, paths of 1,2,3,... n length, cycles (loops) of 3,4,,,,n length, Euler paths or cycles, Hamilton paths and cycles, Color the graph, Check Izomorphism with other graph, Short Path between Two Nodes etc.

Programming assignments for the course CSE3081 - Design and Analysis of Algorithms course (알고리즘설계와분석), Fall 2020, Sogang University

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

Data Analysis for Genomics, De Bruijn Graph Chain Merging Compacting.

Euler-path to stick diagrams - VLSI

Euler path computation in Prolog

Data Analysis for Genomics, Euler Path for Genome Assembly.

C++ program to find and print either an euler path, euler circuit, hamiltonian path, hamiltonian circuit from a given graph.

This repository contains source code that is aimed at converting a Spice NetList to its corresponding layout.