This document describes finding the longest path between two nodes in a graph using a modified Dijkstra's algorithm. It provides an example graph and walks through the steps of the algorithm to calculate the longest path from node A to B. Pseudocode is provided for the longest path Dijkstra's algorithm. Programming code in C is shown to implement the algorithm on the example graph. The output of running the program on the input graph is the longest path A B C F E D.