Back to my Home Page
SUNY Brockport Home Page

Directed Path Problem Using DNA

This is a program that simulates solving the directed path problem using DNA. The program takes the number of vertices, how they are connected with each other as an input. The output is the DNA encoding for each vertex and edge, and the DNA-encoded shortest directed path between the start and end verticies.

NOTE: If only want to use limited number of edges, leave the rest empty.

Number of verticies *range between 1 and 6

First Edge           Second Edge           Third Edge      
Forth Edge         Fifth Edge                Sixth Edge      
Seventh Edge      Eighth Edge      
Ninth Edge * i.e 1,3 (must have comma in between)

Last Updated on: Sunday May 23, 2004
Created by: Mohammed Alabsi
Email: alabsi82@hotmail.com