Skip to content

Commit 0ca10e5

Browse files
authored
Update README.md
1 parent cd5f3e8 commit 0ca10e5

1 file changed

Lines changed: 1 addition & 1 deletion

File tree

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# dijkstra-water-wire
22
This is a C / C++ program for Dijkstra's single source shortest
3-
path algorithm taken from http://www.geeksforgeeks.org/printing-paths-dijkstras-shortest-path-algorithm/, Aditya Goel.
3+
path algorithm based off of code from http://www.geeksforgeeks.org/printing-paths-dijkstras-shortest-path-algorithm/, by Aditya Goel.
44
The code has been modified to calculate water wires connecting a donor and acceptor from an MD simulation.
55
Currently, only Amber MD has been tested and the code can use either a pdb trajectory file
66
or an Amber ASCII trajectory file (mdcrd). For a path to be accepted, waters must be within

0 commit comments

Comments
 (0)