Shulou(Shulou.com)05/31 Report--

This article introduces the relevant knowledge of "how to achieve topological sorting on C++". In the operation of actual cases, many people will encounter such a dilemma, so let the editor lead you to learn how to deal with these situations. I hope you can read it carefully and be able to achieve something!

Package com.lifeibigdata.algorithms.google;/** * Created by lifei on 16-5-23. * / import java.util.ArrayList;import java.util.List;/** * the topological sort here is sorted by f [] descending order of DFS. * another way to achieve this is to keep taking away points with zero entry degree * @ author xiazdong * * / public class TopologicalSort_Algorithm {private static final int WHITE = 0; private static final int GRAY = 1; private static final int BLACK = 2; private int color []; private int size; private int f []; private int time; private Adjacent_List G; / / adjacency table private List resultList / / store the sequence public TopologicalSort_Algorithm (Adjacent_List G) {this.G = G; size = G.getSize (); color = new int [size]; f = new int [size]; time = 0; resultList = new ArrayList (); for (int iSig0

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.