directed graph

編程作業: WordNet 100分 檢查沒有環且同根 如果自製BFS可以更快(搜尋到共同祖先即停止) WordNet.java import java.util.HashMap; import java.util.HashSet; import java.util.Iterator; import java.util.Map; import java.util.Set; import edu.princeton.cs.algs4.Digraph; import edu.princeton.cs.algs4.DirectedCycle; import edu.princeton.cs.algs4.In; public class WordNet { private final Map<Integer, String> synsetsById; private final Map<String, Set<Integer>> synsets; private final Digraph digraph; private final SAP sap; private final Iterable<String> iterable = () -> new NounsIterator(); // constructor takes the name of the two input files public WordNet(String synsets, String hypernyms) { this(new In(requireNonNull(synsets)), new In(requireNonNull(hypernyms))); } private WordNet(In synsets, In hypernyms) { requireNonNull(synsets); requireNonNull(hypernyms); this.