---

class FlowNetwork extends WeightedDigraph
{
    /**
    * Finds an augmenting path from the source to the sink and returns
    * it as a list (stack) of oriented edges. Returns null if there is no
    * augmenting path.
    * @param source
    * @param sink
    * @return
    */
    List<OrientedFlowEdge> getAugmentingPath(int source, int sink)
    {       
        throw new UnsupportedOperationException("Write this method.");
    }

    /**
    * This method is initially called with an augmenting path consisting
    * of just one forward edge emanating from the start vertex. The method
    * implements a backtracking dfs type search to extend the augmenting
    * path all the way to the source. If no augmenting path can be found the
    * method returns false with the stack of edges left in the same state
    * as at the time of the call. If an augmenting path is found, it is
    * stored in the stack of oriented flow edges augPath and the method
    * returns true.
    * @param augPath   
    * @param visited An array of boolean indicating which vertices have
    * already been visited in an attempt to find an augmenting path.
    * When the method backtracks, the visited vertices remain marked.
    * @param sink

    * @return true if an augmenting path is found, false otherwise.
    */
    boolean dfs(Stack<OrientedFlowEdge> augPath, boolean [] visited, int sink)
    {     
      throw new UnsupportedOperationException("Write this method.");
    }
    /**
    * returns the maximum additional flow that can be pushed through
    * an augmenting path
    * @param path
    * @return
    */
    int getIncrementalFlow(List<OrientedFlowEdge> path)
    {
      throw new UnsupportedOperationException("Write this method.");   
    }
    /**
    * Modify the flow in the network along the augmenting path
    * @param augPath
    * @return the incremental flow used that  pushed through the path
    */
    int augmentFlow(List<OrientedFlowEdge> augPath)
    {
            throw new UnsupportedOperationException("Write this method.");
    }
}

---

---

  import java.awt.*;
  import java.awt.event.*;
  import javax.swing.*;
  import java.lang.*;
public class My_RSA extends JFrame {
              private Container  container;
              private JFrame iFrame,jFrame, kFrame;
              private GridBagLayout layout;
              private GridBagConstraints constraints;
              private JTextField nField, dField;
              private JTextArea messageArea, cypherArea, plainArea,keysArea;
              private  JScrollPane messagescroll, cypherScroll, plainScroll;
              private JButton readButton, sendButton, okButton, cancelButton;
              private JPanel jPanel, nPanel,dPanel, okPanel,myPanel, mePanel,
  statusPanel, progressPanel,cancelPanel;
              private JPanel boardPanel1, boardPanel2, cypherPanel,plainPanel,
  messagePanel, readPanel, sendPanel;
              private JLabel emptyLabel, jLabel, nLabel, dLabel, dumLabel1, dumLabel2,
  statusLabel;
              private  JLabel emptyLabel1,  emptyLabel2 , emptyLabel3, emptyLabel4;
              private  JPanel emptyPanel,  emptyPanel1, emptyPanel2, emptyPanel3,
    emptyPanel4;
                private String message = "", plaintext = "", cyphertext = "", publish = "";
                private long d, e, m, n, p, q;
                private final JProgressBar  current = new JProgressBar(0, 100);
         
                    private  KeyGenerator gen;
                    private  Encryption enc;
                    private  Decryption dec;
                    private  Sending go;
  public My_RSA()
  {
                Super("RSA Encryption System");

                Container = getContentPane();
                layout = new GridBagLayout();
                container.setLayout(layout);
                constraints = new GridBagConstraints();
                gen = new KeyGenerator();
                kFrame = new JFrame("Sending...");
                mePanel = new JPanel();
                mePanel.setLayout(layout);
                progressPanel = new JPanel();
                progressPanel.add(current);
                  cancelPanel = new JPanel();
                  statusPanel = new JPanel();
                  statusPanel = new JLabel(" From A to B");
                  statusPanel.add(statusLabel);
                  cancelButton = new JButton("cancel");
                  cancelButton.addActionListener(
              new ActionListener() {
                            public void actionPerformed(ActionEvent event)
                            {
                                            Current.setValue(0);
                                            kFrame.setVisible(false);
                                }
                    }
  );
  Current.setSize(100, 5);
  cancelPanel.add(cancelButton);
  emptyLabel1 = new JLabel("");
  emptyLabel2 = new JLabel("");
  emptyLabel3 = new JLabel("");
  emptyLabel4 = new JLabel("");
    emptyPanel1 = new JPanel();
    emptyPanel2 = new JPanel();
    emptyPanel3 = new JPanel();
    emptyPanel4= new JPanel();
        readPanel = new JPanel();
        sendPanel = new JPanel();
        messagePanel = new JPanel();
        cypherPanel = new JPanel();
        plainPanel = new JPanel()
        boardPanel1 = new JPanel();
        boardPanel1.setLayout(new FlowLayout());
        boardPanel2 = new JPanel();
        boardPanel2.setLayout(new FlowLayout());
          messageArea = new JTextArea(5,60);
          messageArea.setLineWrap(true);
          messageArea.setWrapStyleWord(true);
          messageArea.setFont(new Font("Monospaced",  Font.PLAIN, 12));
          messageArea.setEditable(true);
          cypherArea = new JTextArea(20,20);
          cypherArea.setLineWrap(true);
          cypherArea.setWrapStyleWord(true);
          cypherArea.setFont(new Font(" Serif",  Font.PLAIN, 12));
          cypherArea.setEditable(false);
          plainArea = new JTextArea(20,22);
          plainArea.setLineWrap(true);
          plainArea.setWrapStyleWord(true);
          plainArea.setFont(new Font(" Monospaced",  Font.PLAIN, 12));
          plainArea.setEditable(false);
          messageScroll = new JScrollPane(messageArea,
  ScrollPaneConstants.VERTICAL_SCROLLBAR_AS_NEEDED,
  ScrollPaneConstants.HORIZONTAL_SCROLLBAR_AS_NEVER);
              cypherScroll = new JScrollPane(cypherArea,
ScrollPaneConstants.VERTICAL_SCROLLBAR_AS_NEEDED,
 ScrollPaneConstants.HORIZONTAL_SCROLLBAR_AS_NEEDED);
            plainScroll = new JScrollPane(plainArea,
 ScrollPaneConstants.VERTICAL_SCROLLBAR_AS_NEEDED,
 ScrollPaneConstants.HORIZONTAL_SCROLLBAR_AS_NEEDED);
            readButton = new JButton("read>>>");
            readButton.addActionListener(
                        new  ActionListener()  {
                                        public void actionPerformed(ActionEvent event)
                                        {
                                                      secretKey();
                                          }
                          }
 );
 sendButton = new JButton("send");
sendButton.addActionListener(
              new ActionListner() {
                            public void actionPerformed(ActionEvent event)
                            {
                                              kFrame.setVisible(false);
                                              publish = "";
                                              do {
                                                              p = gen.primeNumber();
                                            }while(!(p > 10)  || !(p < 26) );
                                            do {
                                                          q = gen.primeNumber();

                                              }while( (q <=p)  || !((q-p) >2) );
                                              n  = p*q;
                                              m = (p-1) * (q-1);
                                              e = gen.coprime(m);
                                              d = gen.find_d(m,e);
                                              message = messageArea.getText();
                                              enc = new Encryption(message);
                                                cyphertext = enc.encrypt(e,n);
                                                publish_Keys();
                                                kFrame.setVisible(true);
                                                go = newSending(cyphertext,kFrame,iFrame,
    cypherArea, current, container);
                                                go.start();
                kFrame.setCursor(Cursor.getPredefinedCursor(Cursor.WAIT_CURSOR));
                container.setCursor(Cursor.getPredefinedCursor(Cursor.WAIT_CURSOR));
                                            }
                                }
                  );
                cypherPanel.add(cypherScroll);
                cypherPanel.setBorder(BorderFactory.createTitledBorder("cyphertext"));
                readPanel.add(readButton);
                plainPanel.add(plainScroll);
                plainPanel.setBorder(BorderFactory.createTitledBorder("recovered plaintext"));
                  messagePanel.add(messageScroll);
                      sendPanel.add(sendButton);
                      emptyPanel1.add(emptyLabel1);
                      emptyPanel2.add(emptyLabel2);
                      emptyPanel3.add(emptyLabel3);
                      emptyPanel4.add(emptyLabel4);
                      boardPanel1.add(cypherPanel);
                      boardPanel1.add(readPanel);
                      boardPanel1.add(plainPanel);

---

---

6
a : b 5 c  13 \
b : c 1 d 10 \
c : b 2 d 7 e 5 \
d : f 7 \
e : d 3 f 4 \
f : \

---

---

public class WeightedDigraph
{
  int numberVertices;
  List<List<WeightedEdge>> adjList = new ArrayList<List<WeightedEdge>>();
  List<String> vertexName = new ArrayList<String>();
  Map<String, Integer> nameToVertex = new HashMap<String, Integer>();
  List<WeightedEdge> getNeighbors(int vertexNumber)
      { return adjList.get(vertexNumber);}
  public int getNumberVertices() { return numberVertices; }
  void buildGraph(Scanner sc)
  { 
      numberVertices = sc.nextInt();
      for (int k = 0; k < numberVertices; k++)
      {
          adjList.add(new ArrayList<WeightedEdge>());
      }
     
      String initVertexName, endVertexName;
      int weight;
      for (int k = 0; k < numberVertices; k++)
      {
          initVertexName = sc.next();       

          int initVertexIndex = vertexName.indexOf(initVertexName);
          if (initVertexIndex == -1)
          {
              // Add the new vertex to the array list and the map
              initVertexIndex = vertexName.size();
              vertexName.add(initVertexName);
              nameToVertex.put(initVertexName, initVertexIndex);
          }
          String separator = sc.next();
          if (! (separator.equals(":"))) throw new RuntimeException("Missing :" +
                  " after initial vertex.");
          String nextToken = sc.next();
          while (!nextToken.equals("\\"))
          {
              endVertexName = nextToken;         

              if (!sc.hasNextInt()) throw new RuntimeException("Missing edge weight");
              weight = sc.nextInt();         
             
              int endVertexIndex = vertexName.indexOf(endVertexName);
              if (endVertexIndex == -1)
              {
                  endVertexIndex = vertexName.size();
                  vertexName.add(endVertexName);
                  nameToVertex.put(endVertexName, endVertexIndex);
              }
              adjList.get(initVertexIndex).add(new WeightedEdge(endVertexIndex, weight));
              nextToken = sc.next();
          }         
      }     
  }
  @Override
  public String toString()
  {
    StringBuilder sB = new StringBuilder();
    for (int k = 0; k < vertexName.size(); k++)
    {
        sB.append(vertexName.get(k) + " : ");
        for (WeightedEdge wE : adjList.get(k))
        {
          sB.append( " (" + vertexName.get(wE.dest) + " " + wE.weight + ") " );
        }
        sB.append(" \\\n");
    }
    return sB.toString();
  }
}

class WeightedEdge
{
  public final int dest;
  public final int weight;
  public WeightedEdge(int dest, int weight)
  {
      this.dest = dest;  this.weight = weight;
  }
  @Override
  public boolean equals(Object other)
  {
      if (other == null) return false;
      if (!(other instanceof WeightedEdge)) return false;
      WeightedEdge wE = (WeightedEdge)other;
      return dest == wE.dest && weight == wE.weight;
  }
}

---

---

  Object objRef = orb.resolve_initial_references("NameService");
  NamingContextExt ncRef = NamingContextExtHelper.narrow(objRef);
  Object o = ncRef.resolve_str(Name);

---

---

public static final Integer multiply(Integer x, Integer y) {
return (y == 0) ? 0 : multiply(x, y - 1) + x;
}

---

---

public LinkedList findOrdersForProduct(Product p, boolean debug) {
ArrayList l = new ArrayList();
ArrayList list = getAllOrders();
for (int i=0; i<list.size(); i++) {
Order order = (Order) list.get(0);
boolean found = false;
if (order.getProducts().size() > 0) {
for (int j=0; j<=order.getProducts().size(); j++) {
Product p2 = order.getProducts().get(j);
found = (p2 == p);
}
if (found && order != null)
l.add(order);
}
}
return new LinkedList(l);
}

---

---

import javax.swing.*;
import java.util.*;
import java.awt.*;
import java.util.List;

public class Main
{

    // This is a list of all possible positions on the
    // triangular N-queens. Positions are 1-based.
    static List<Position> boardPositions;
    public static void main(String[] args)
    {
      String input = JOptionPane.showInputDialog(null,
                  "Triangular Queens: Enter a positive integer", "6" );
      int n = Integer.parseInt(input.trim());

      boardPositions = getBoardPositions(n);
      Stack<Position> partialSol = new Stack<Position>();
      System.out.println("Size of maximal placement is " + (2*n + 1)/3);
      extendQueensPlacement(partialSol, 0, n);

      System.out.println("Size of solution is " + partialSol.size());
      for (Position p : partialSol)
          System.out.print(p + "  ");
      Board queensDisplay = new Board(n, partialSol);
      JOptionPane.showMessageDialog(null, queensDisplay, "Triangular N Queens",
              JOptionPane.INFORMATION_MESSAGE);
    }
    /**
    *
    * @param partialSol
    * @param k the index of the boardPosition we are about to try to include
    * in partialSol. This is an index into the static class member boardPositions
    * whick is a List of Position objects.
    * @param n
    * @return true if the partial solution is successfully extended to a
    * complete solution, and returns false otherwise. If the false is returned, then
    * the partial solution with the same value it had at the call.
    */
    public static boolean extendQueensPlacement(Stack<Position> partialSol,
                                                int k, int n)
    {
        if(isComplete(partialSol, n))
            return true;

        for(k = 0; k < boardPositions.size(); k++)
        {
            if(!attacks(boardPositions.get(k), partialSol))
                partialSol.add(boardPositions.get(k));
        }

        return false;
    }

    /**
    * Checks to see if a partial solution is a complete solution.
    * @param partialSolution
    * @param n The size of the board.
    * @return true or false as appropriate
    */
    static boolean isComplete(Stack<Position> partialSolution, int n)
    {
        return partialSolution.size() == (2*n + 1)/3;
    }

    /**
    * Check to see if two position attack each other
    * @param p A position on the board (1-based)
    * @param q A position on the board (1-based)
    * @return true if they attack each other, false otherwise.
    */
    static boolean attacks(Position p, Position q)
    {
        return p.row == q.row || p.col == q.col || p.row - p.col == q.row - q.col;
    }

    /**
    * Checks to see a position attacks and position in a given list of
    * positions.
    * @param p a single position
    * @param posList a list of positions
    * @return true if p attacks at least one position in posList
    */
    static boolean attacks(Position p, List<Position> posList)
    {
        for (Position pos : posList)
        {
            if (attacks(p, pos)) return true;
        }
        return false;
    }
    /**
    * This method may not be needed. It removes from posList all positions
    * that attack pos. It returns the list of positions removed in this manner.
    * @param pos
    * @param posList
    * @return a list of all positions in posList, OTHER THAN pos, that attack
    * pos.
    */
    static List<Position> removeAttackers(Position pos, List<Position> posList)
    {
        List<Position> attackers = new ArrayList<Position>();
        for (int k = 0; k < posList.size(); )
        {
            Position p = posList.get(k);
            if (attacks(pos, p))
            {
                posList.remove(p);
                if (p != pos) attackers.add(p);
            }
            else k++;
        }
        return attackers;
    }
    /**
    * Used to generate the list of 1-based triangular board positions.
    * 1, 1 through n, n
    * @param n
    * @return list of triangular board positions.
    */
    static List<Position> getBoardPositions(int n)
    {
        List<Position> boardPosition = new ArrayList<Position>();
        for (int row = 1; row <= n; row ++)
            for (int col = 1; col <= row; col++)
                boardPosition.add(new Position(row, col));
        return boardPosition;
    }

    /** Used for debugging
    * Prints all Positions in a list
    * @param posList
    */
    static void println(List<Position>posList)
    {
        for (Position p : posList)
            System.out.print(p + " ");
        System.out.println();
    }
}

/**
 * A position indicating on the board for the triangular
 * N queens problem.
 * @author gcm
 */
class Position
{
    public final int row, col;
    public Position(int row, int col)
    {
        this.row = row;
        this.col = col;
    }
    public String toString()
    {
        return "[" + row + "," + col + "]";       
    }
}

// A Graphical view of the triangular board with the queens placed.
// The constructor takes a list of queen positions and a board size
// and creates a JPanel neatly showing the placement of the queens.
class Board extends JPanel
{
    private int n; // size of board
    Board(int n, List<Position> placements)
    {
        super(new GridLayout(n, 2*n-1));
        this.n = n;
        // create the labels to diplay the placements
        JTextField labels [][] = new JTextField[n][2*n-1];
        for (int row = 0; row < n; row++)
            for (int col = 0; col < 2*n-1; col++)
            {
                labels[row][col] = new JTextField(" ");             
                add(labels[row][col]);
                labels[row][col].setEditable(false);
            }

        for (int r = 0; r < n; r++)
        {
            int startCol = n-1-r;
            for (int k = 0; k < r+1; k++)
            {
                labels[r][startCol + 2*k].setBackground(Color.YELLOW);
            }
        }
        // place the queens
        for (Position p : placements)
        {
            int r = p.row-1;
            int c = p.col-1;
            //labels[r][c].setForeground(Color.RED);
            //labels[r][c].setText("Q");
            labels[r][n-1 -r + 2*c].setForeground(Color.RED);
            labels[r][n-1 -r + 2*c].setText("Q");
            labels[r][n-1 -r + 2*c].setToolTipText(p.toString());

        }
    }

}

---

---

public boolean equals(Object o)
{
System.out.println(o instanceof Moof);
System.out.println(((Moof)o).getMoofValue());
System.out.println(this.moofValue); //XXX
if ((o instanceof Moof) && (((Moof)o).getMoofValue() == this.moofValue))
{
return true;
}
else
{
return false;
}

---