Yeah...that title is intended to help a search engine, but it is quite descriptive. This program finds all paths between a source and destination vertex in a graph using depth-first search (DFS). This program is not intended to be optimal; it is designed to be naive and obvious to assist correctness. You can provide edge weights for input compatibility with my online Dijkstra solver in JavaScript. This program will ignore anything on a line after the second space-separated token.