Hi Shashank and Eugene, (@sss1 @escanlon)

Sung said that he would be available for meeting tomorrow from 3pm.
(I will be available for the whole day.)

Jimmy

As the title suggests. Notice that the solution is not verified by the Professor. But I think it should be correct.
It is available at: ymzong/puzzlesolver@ee7c9943ceff9a918e636d4e9ffc2d66af15596b.

The longest one I observe is in the directory ./reverse/gogo1.txt, which has 277 movie titles!

Hi folks, all the code and data for this project have been posted at: ymzong/movie-chain-runner@4d7b707a05ccbec697c7ba56dba764f3ef0ea1b7.

Brute Force Algorithm II:
1. Find any cycle in the graph;
2. Cut one of the edges to break it;
3. Repeat 1 and 2, until the graph is DAG.
4. Use topological sort to get the longest path in the final DAG.

The Brute Force part happens in Step One and Two, which include ziillions of possibilities. However, the current rough algorithm currently can only run 1s/graph case. Too slow to happen, and the process cannot be divided into different CPU Threads. Sigh. Giving up the Bruth Force II.

Hi everyone, I have pushed out current record with 278 movie titles on github. I will update this "issue" page with the number of words very soon.

By the way, I have started 14 jobs on GHC machines, and I will check the results before our class starts tomorrow.

Special note: this is a target, not an existing achievement!

Hi folks,
I just fixed a bug in my reverse algorithm that could harm the performance by ~30%...
@sss1 @escanlon @sungukr