src/main/java/de/dfki/lt/loot/fsa/algo/MinimizationBrzowski.java
public static <EdgeInfo> void minimize(
    AbstractAutomaton<EdgeInfo> graph, Comparator<EdgeInfo> comp) {

    // sort edges
    //sortEdges(graph);

    // this array will hold the node number of the equivalence class
    // representative for each node; if representative[i] == i, node i is one
    // of the representatives; if representative[i] == j, then node j is the
    // representative of the equivalence class i belongs to
    int[] representative = computeEquivalentVertices(graph, comp);

    Minimization.reduceAutomaton(graph, representative, comp);
  }
/**
   *  This computes the minimal automaton equivalent to this one.
   *
   *  The current automaton is turned destructively into its minimal
   *  counterpart. Only use this method on a determinized automaton, which can
   *  be created with {@link #determinize()}.
   */
This computes the minimal automaton equivalent to this one.
The current automaton is turned destructively into its minimal
counterpart. Only use this method on a determinized automaton, which can
be created with  #determinize().
This computes the minimal automaton equivalent to this one . The current automaton is turned destructively into its minimal counterpart . Only use this method on a determinized automaton which can be created with #determinize () .
public static <EdgeInfo> void minimize(
    AbstractAutomaton<EdgeInfo> graph, Comparator<EdgeInfo> comp) {
    int[] representative = computeEquivalentVertices(graph, comp);
    Minimization.reduceAutomaton(graph, representative, comp);
  }
public static < EdgeInfo > void minimize ( AbstractAutomaton < EdgeInfo > graph , Comparator < EdgeInfo > comp ) { int [ ] representative = computeEquivalentVertices ( graph , comp ) ; Minimization . reduceAutomaton ( graph , representative , comp ) ; }
This computes the minimal automaton equivalent to this one.
This computes the minimal automaton equivalent to this one .
// sort edges //sortEdges(graph); // this array will hold the node number of the equivalence class // representative for each node; if representative[i] == i, node i is one // of the representatives; if representative[i] == j, then node j is the // representative of the equivalence class i belongs to