import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;

public class hw4{

private static class MyClosure{
   static int FUNC = 1;
   static int IN_OUT_FUNC = 2;
   HashMap<String, Object> hm;
   ArrayList<String> codes;
   String parameter;
   int type;

   public MyClosure(HashMap<String, Object> hm, int type) {
         codes = new ArrayList<>();
         this.hm = new HashMap<>(hm);
         this.type = type;
   }

   public ArrayList<String> getCodes(String value,
            HashMap<String, Object> hm) {
         ArrayList<String> realCodes = new ArrayList<>();
         for (String code : codes) {
            String [] sp = code.split("\\s+");
            //("hw3.MyClosure.getCodes() " + code);
            if (sp.length == 1) {
               realCodes.add(code);
            } else if (sp[1].equals(parameter)) {
               if (value.equals(":true:")
                        || value.equals(":false:")) {
                     realCodes.add(value);
               } else {
                     realCodes.add(sp[0] + " " + value);
               }
            } else {
               //("code = " + code);
               realCodes.add(code);
            }
         }
         return realCodes;
   }

}

Use the the bellman - ford algorithm and implement it in java. It s...