001
002
003
004
005
006
007
008
009
010
011
012
013
014
015
016
017
018
019
020
021
022
023
024
025
026
027
028
029
030
031
032
033
034
035
036
037
038
039
040
041
042
043
044
045
046
047
048
049
050
051
052
053
054
055
056
057
058
059
060
061
062
063
064
065
066
067
068
069
070
071
072
073
074
075
076
077
078
079
080
081
082
083
084
085
086
087
088
089
090
091
092
093
094
095
096
097
098
099
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
package algs42;

import java.util.Iterator;
import java.util.LinkedList;
import algs13.Queue;
import stdlib.*;

public class MyEuler {
  // local copy of the graph
  private Queue<Integer>[] adj;
  private int E;
  private boolean isEulerian = true;

  @SuppressWarnings("unchecked")
  public MyEuler(Digraph G) {
    // create local copy of graph
    adj = new Queue[G.V()];
    for (int v = 0; v < G.V(); v++) {
      adj[v] = new Queue<>();
      for (int w : G.adj(v))
        adj[v].enqueue(w);
    }
    // get initial number of edges
    E = G.E ();
    if (E == 0) {
      isEulerian = true;
      return;
    }
    // find starting vertex with at least one edge
    int s = 0;
    while (adj[s].isEmpty ())
      s++;

    // TODO
  }
  public Iterable<Integer> tour() {
    // TODO
    return null;
  }
  public boolean isEulerian() {
    return isEulerian;
  }

  public static boolean isTour(Digraph G, Iterable<Integer> tour) {
    @SuppressWarnings("unchecked")
    LinkedList<Integer>[] adj = new LinkedList[G.V()];
    int E = G.E ();
    for (int v = 0; v < G.V(); v++) {
      adj[v] = new LinkedList<>();
      for (int w : G.adj(v))
        adj[v].add(w);
    }
    if (tour == null)
      return E == 0;
    Iterator<Integer> it = tour.iterator ();
    if (!it.hasNext())
      return E == 0;
    int s = it.next();
    int v = s;
    while (it.hasNext()) {
      int w = it.next();
      if (adj[v].contains(w)) {
        adj[v].remove((Integer) w);
        E--;
        v = w;
      } else {
        throw new Error();
      }
    }
    if (v != s) throw new Error();
    if (E != 0) throw new Error();
    return (v == s) && (E == 0);
  }

  public static Digraph inOutEqual (int V, int E) {
    // random graph of V vertices and approximately E edges
    // with indegree[v] = outdegree[v] for all vertices
    Digraph G = new Digraph(V);
    int[] indegree  = new int[V];
    int[] outdegree = new int[V];
    int deficit = 0;
    for (int i = 0; i < E - deficit/2; i++) {
      int v = StdRandom.uniform(V);
      int w = StdRandom.uniform(V);
      if (v == w) { i--; continue; }
      G.addEdge(v, w);
      if (outdegree[v] >= indegree[v]) deficit++;
      else                             deficit--;
      outdegree[v]++;
      if (indegree[w] >= outdegree[w]) deficit++;
      else                             deficit--;
      indegree[w]++;
    }
    while (deficit > 0) {
      int v = StdRandom.uniform(V);
      int w = StdRandom.uniform(V);
      if (v == w) continue;
      if (outdegree[v] >= indegree[v]) continue;
      if (indegree[w]  >= outdegree[w]) continue;
      G.addEdge(v, w);
      if (outdegree[v] >= indegree[v]) deficit++;
      else                             deficit--;
      outdegree[v]++;
      if (indegree[w] >= outdegree[w]) deficit++;
      else                             deficit--;
      indegree[w]++;
    }
    return G;
  }
  public static void main(String[] args) {
    //args = new String[] { "data/tinyDG.txt" }; // NO
    //args = new String[] { "data/tinyCG.txt" }; // NO
    //args = new String[] { "data/tinyDGeuler9.txt" }; // YES
    //args = new String[] { "data/tinyDGeuler2.txt" }; // YES
    //args = new String[] { "data/tinyDGeuler3.txt" }; // YES
    //args = new String[] { "data/tinyDGeuler4.txt" }; // YES
    //args = new String[] { "data/tinyDGeuler5.txt" }; // NO
    //args = new String[] { "data/tinyDGeuler6.txt" }; // YES
    //args = new String[] { "data/tinyDGeuler7.txt" }; // NO
    //args = new String[] { "data/tinyDGeuler8.txt" }; // YES
    //args = new String[] { "data/tinyDGeuler9.txt" }; // YES
    args = new String[] { "20", "40" };

    Digraph G;
    if (args.length == 1) {
      In in = new In(args[0]);
      G = new Digraph(in);
    } else {
      int V = Integer.parseInt(args[0]);
      int E = Integer.parseInt(args[1]);
      while (true) {
        G = inOutEqual(V,E);
        if (new KosarajuSharirSCC(G).count () == 1)
          break;
      }
    }
    StdOut.println(G);
    YEuler euler0 = new YEuler(G, 1);
    if (euler0.isEulerian()) {
      for (int v : euler0.tour())
        StdOut.print(v + " ");
      StdOut.println();
    } else {
      StdOut.println("Not eulerian");
    }
    if (!isTour(G,euler0.tour())) StdOut.println("Not a tour");
    YEuler euler1 = new YEuler(G, 2);
    if (euler1.isEulerian()) {
      for (int v : euler1.tour())
        StdOut.print(v + " ");
      StdOut.println();
    } else {
      StdOut.println("Not eulerian");
    }
    if (!isTour(G,euler1.tour())) StdOut.println("Not a tour");
  }
}