File: conflicts.ml

package info (click to toggle)
coinst 1.9.3-3
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye
  • size: 1,720 kB
  • sloc: ml: 15,760; javascript: 10,468; makefile: 149; ansic: 52
file content (150 lines) | stat: -rw-r--r-- 4,844 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
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
(* Co-installability tools
 * http://coinst.irill.org/
 * Copyright (C) 2010-2011 Jérôme Vouillon
 * Laboratoire PPS - CNRS Université Paris Diderot
 *
 * These programs are free software; you can redistribute them and/or
 * modify them under the terms of the GNU General Public License as
 * published by the Free Software Foundation; either version 2 of the
 * License, or (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 *)

(*
Data Reduction and Exact Algorithms for Clique Cover
Jens Gramm, Jiong Guo, Falk Huffner, and Rolf Niedermeier

XXX This implementation should be made more robust: at the moment, if we fail
to decompose the conflicts into obvious maximal cliques, we do not try to find
any other clique...
*)

module F (R : Repository.S) = struct

open R

module Quotient = Quotient.F(R)

module Pair (X : Set.OrderedType) (Y : Set.OrderedType) =
  struct
    type t = X.t * Y.t
    let compare (x, y) (x', y') =
      let c = X.compare x x' in if c = 0 then Y.compare y y' else c
  end

module PPairMap = Map.Make (Pair (Package) (Package))

let print_clique quotient s =
  Format.eprintf "Clique:";
  PSet.iter
    (fun p -> Format.eprintf " %a" (Quotient.print_class quotient) p) s;
  Format.eprintf "@."

let f quotient confl =
  let l = ref [] in
  let common = ref PPairMap.empty in
  Conflict.iter confl
    (fun p q ->
       let c =
         PSet.inter
           (Conflict.of_package confl p)
           (Conflict.of_package confl q)
       in
       let n = ref 0 in
       Conflict.iter confl
         (fun p' q' -> if PSet.mem p' c && PSet.mem q' c then incr n);
       assert (p < q);
       common := PPairMap.add (p, q) (c, PSet.cardinal c, !n) !common);
  let covered = Conflict.create (Quotient.pool quotient) in
  let removed = PTbl.create (Quotient.pool quotient) false in
  let changed = ref false in
  while
    changed := false;
(*
prerr_endline "AAAAA";
*)
    PPairMap.iter
      (fun (p, q) (c, i, n) ->
         let m = (i * (i - 1)) / 2 in
         if m = n && not (Conflict.check covered p q) then begin
(*
           Format.eprintf "Rule 2: %a # %a : %d -- %d / %d %b@."
             (Quotient.print_class quotient) p (Quotient.print_class quotient) q
             i m n (m = n);
*)
           let c = PSet.add p (PSet.add q c) in
(*
           print_clique quotient c;
*)
           l := c :: !l;
           changed := true;
           PSet.iter
             (fun p ->
                PSet.iter
                  (fun q ->
                     if p < q then begin
                       Conflict.add covered p q;
                       common := PPairMap.remove (p, q) !common
                     end)
                  c)
             c;
           PSet.iter
             (fun p ->
                let neigh = Conflict.of_package confl p in
                if
                  not (PTbl.get removed p) &&
                  PSet.for_all (fun q -> Conflict.check covered p q) neigh
                then begin
                  PTbl.set removed p true;
                  Conflict.iter confl
                    (fun p' q' ->
                       if PSet.mem p' neigh && PSet.mem q' neigh then begin
(*
  Format.eprintf "%a => %a %a@."
    (Quotient.print_class quotient) p  (Quotient.print_class quotient) p' (Quotient.print_class quotient) q';
*)
                         try
                         let (d, i, n) = PPairMap.find (p', q') !common in
(*
  Format.eprintf "-@.";
*)
  assert (PSet.mem p d);
                         let d = PSet.remove p d in
                         let n = n - PSet.cardinal (PSet.inter neigh d) in
(*
  Format.eprintf "%d@." i;
*)
                         assert (n >= 0);
                         if i = 0 then
                           common := PPairMap.remove (p', q') !common
                         else
                           common :=
                             PPairMap.add (p', q')
                               (d, i - 1, n) !common
                         with Not_found ->
                           ()
                       end)
                end)
             c
         end)
      !common;
    !changed
  do () done;
  PPairMap.iter
    (fun (p, q) (c, i, n) ->
       let m = (i * (i - 1)) / 2 in
       Format.eprintf "Remaining edge: %a # %a : %d -- %d / %d %b@."
         (Quotient.print_class quotient) p (Quotient.print_class quotient) q
         i m n (m = n);
       l := PSet.add p (PSet.singleton q) :: !l)
    !common;
  !l

end