http://stevenphung.org Thoughts of a Coder, Student, and Gamer Wed, 19 May 2010 15:33:34 -0700 http://wordpress.org/?v=2.9.2 hourly 1 http://stevenphung.org/?p=169&cpage=1#comment-10 stphung Wed, 19 May 2010 15:33:34 +0000 http://stevenphung.org/?p=169#comment-10 <p>I wasn't aware that it didn't work for longest path, intuitively it just seemed like it would.  I'll definitely read up on longest common substring and try to find similarities there, thanks!</p> I wasn't aware that it didn't work for longest path, intuitively it just seemed like it would.  I'll definitely read up on longest common substring and try to find similarities there, thanks!

]]> http://stevenphung.org/?p=169&cpage=1#comment-9 Jamie Lawson Wed, 19 May 2010 13:16:09 +0000 http://stevenphung.org/?p=169#comment-9 Recall that Dijkstra is a "shortest path" algorithm. Doesn't work for "longest path". In fact, "longest path" is NP-Hard in a general graph. What you've done seems to be a specialization of the discrete dynamic programming algorithm. You might look at algorithms for "Longest Common Substring" (a classic problem where discrete dynamic programming works) and see if it's the same thing. Recall that Dijkstra is a "shortest path" algorithm. Doesn't work for "longest path". In fact, "longest path" is NP-Hard in a general graph. What you've done seems to be a specialization of the discrete dynamic programming algorithm. You might look at algorithms for "Longest Common Substring" (a classic problem where discrete dynamic programming works) and see if it's the same thing.

]]> http://stevenphung.org/?p=131&cpage=1#comment-8 Morbidd Mon, 15 Mar 2010 19:40:42 +0000 http://stevenphung.org/?p=131#comment-8 Reading this brought back some awesome memories! It makes me very proud to part of this guild. Great times indeed! Reading this brought back some awesome memories! It makes me very proud to part of this guild. Great times indeed!

]]> http://stevenphung.org/?p=131&cpage=1#comment-6 Dvorak Sat, 24 Oct 2009 04:47:34 +0000 http://stevenphung.org/?p=131#comment-6 *sniff sniff. awesome read! *sniff sniff. awesome read!

]]> http://stevenphung.org/?p=120&cpage=1#comment-4 R. P. Dillon Thu, 24 Sep 2009 08:30:52 +0000 http://stevenphung.org/?p=120#comment-4 It's actually really nice to see some screencasts focused on idioms in popular languages like Java. This is a good introduction for new Java programmers on how to choose among Java's "for" looping constructs, and how to make your code compatible with the newer variety. Thanks! It’s actually really nice to see some screencasts focused on idioms in popular languages like Java. This is a good introduction for new Java programmers on how to choose among Java’s “for” looping constructs, and how to make your code compatible with the newer variety. Thanks!

]]>