拓扑排序（Topological sort）.docVIP

拓扑排序（Topological sort） Topological sort ------------------------------------------------------------------ Class 1: the adjacency table representation of a spanning graph Import java.util.ArrayList; Import java.util.List; Import java.util.Scanner; Public, class, GenerateMap { The number of vertices in the graph / / Private int size; Public, int, getSize () { Return size; } Access to information / adjacency list Private ListListInteger map; Public, ListListInteger, getMap () { Return map; } Console input / / Private Scanner input; Private, void, setUp () { Map = new, ArrayListListInteger (); ListInteger temp; For (int i = 0; I size; ++i) { Temp = new, ArrayListInteger (); Map.add (temp); } } Private, void, init (), throws, Exception{ System. out.println (the following input data is separated by spaces or commas); For (int i = 0; I size; ++i) { System. out.format (enter the point adjacent to the vertex%d:, i+1); String string = input.nextLine (); DealString (string, I); } Input.close (); } Private, void, dealString (String, string, int, flag) throws Exception{ (if) (string.length = 0) Return; If (flag 0 size {flag ||) Throw, new, Exception (ERROR); } String[] STRs = string.split (|.); For (int i = 0; I strs.length; ++i) { Int number = Integer.valueOf (strs[i]); If (number 1 || number size) Throw new Exception (Input error!); If (number-1 = flag) Continue; Map.get (flag).Add (number); } } / / graph adjacency list Public GenerateMap (int size) throws Exception{ This.size = size; This.setUp (); Input = new, Scanner (System.in); This.init (); } Print / adjacency table information Public, void, print () { Int i = 1; For (ListInteger, list:map) { System. out.print (i++ + :); System. out.println (list.toString ()); } } } ------------------------------------------------------------- 测试： 公共类测试{ public static void main（String [] args）{抛出异常 generatemap地图=新generatemap（7）； print()地图； } } ----------------------------------------------------------- 2：拓扑排序类类 进口java.util.arrayd