FilesExpand file tree

master

/

vertex_cover.pi

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

22 lines (20 loc) · 418 Bytes

master

/

vertex_cover.pi

Copy path

Top

File metadata and controls

• Code
• Blame

22 lines (20 loc) · 418 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

import sat.

main =>

G = graph(),

N = len(G),

Vars = new_list(N),

Vars :: 0..1,

foreach (U in 1..N-1, V in U+1..N)

if G[U,V] == 1 then

Vars[U] #\/ Vars[V]

end

end,

solve($[min(sum(Vars))],Vars),

print(Vars).

graph =

{{0,1,0,0,1,0},

{1,0,1,0,1,0},

{0,1,0,1,0,0},

{0,0,1,0,1,1},

{1,1,0,1,0,0},

{0,0,0,1,0,0}}.