1. Implement Depth-First Search. Scenario: given an image that has e.g. black regions use D-F Search or to scan the image, find all the regions and return as an answer the total number of regions and their size.
2. Implement a Floyd's dynamic programming algorithm for all pairs shortest path problem. Scenario: Given an arbitrary weighted digraph your program using Floyd's algorithm must return a list of all-pairs shortest paths.
Must be in Java.
Please see the private message. I'm a student at one of the world's top Computer Science universities. Hence, I can write graph algorithms in my sleep.