Algorithm
Check whether a directed graph is Eulerian
import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Record; // A category to retailer a graph edge class Edge int supply, dest; public Edge(int