Компоненты связности графа

include "lab3.inc"
 
domains
sym = symbol
listSym = sym*
liSym = listSym*
predicates
edge(sym,sym)
e(sym,sym)
member(sym,listSym)
path(sym,sym,listSym)
p(sym,listSym,listSym)
not_connected
is_connected(liSym)
r_dup(listSym,listSym)
delete(sym,listSym,listSym)
spisok(listSym,liSym)
spisok2(sym,listSym,liSym)
spisok3(liSym,listSym)
temp(sym,sym,listSym)
test(liSym,listSym,liSym)
append(liSym,liSym,liSym)
conc(listSym,listSym,listSym)
clauses
temp(A,B,C):-C=[A,B].
edge(a, b).
edge(b, e).  
edge(e, f).
edge(c, d).
e(A,B):-edge(A,B).
e(A,B):-edge(B,A).
member(H,[H|_]).
member(X,[_|Tail]):-member(X,Tail).
path(A,B,P):-p(A,[B],P).
p(A,[A|T],[A|T]).
p(A,[B|Tail],P):-e(B,C),not(member(C,Tail)),p(A,[C,B|Tail],P).
not_connected:-e(A,_),e(B,_),A<>B,not(path(A,B,_)).
is_connected(R):-not_connected,findall(X,edge(X,_),L1),spisok4(L1,R),!.%,write(K),nl,spisok3(K,R1),r_dup(R1,R2),!,R=[R2].
is_connected(R):-not(not_connected),findall(X,edge(X,_),L),r_dup(L,LN),!,spisok(LN,K),spisok3(K,R1),r_dup(R1,R2),!,R=[R2].
spisok([H|T],R):-findall(X,edge(H,X),L),spisok2(H,L,R1),spisok(T,Z),append(R1,Z,R).
spisok([],[]).
 
spisok2(X,[Y|Y1],R):-temp(X,Y,Z),spisok2(X,Y1,R2),test(R2,Z,R1),R=R1.
spisok2(_,[],[]).
 
spisok3([H|T],R):-spisok3(T,R1),conc(H,R1,R).
spisok3([],[]).
 
spisok4(X,Y):-
 
test([],E,[E]).
test([L1|H1],E,[L1|H2]):-test(H1,E,H2).
 
conc([],Y,Y).
conc([X|XL],YL,[X|ZL]):-conc(XL,YL,ZL).
 
append([],Y,Y).
append([X|XL],YL,[X|ZL]):-append(XL,YL,ZL).
 
    
delete(_,[],[]).
delete(X,[X|T],R):-delete(X,T,R).
delete(X,[H|T],[H|R]) :-delete(X,T,R).
 
r_dup([],[]).
r_dup([H|T], [H|R]):-member(H,T),!,delete(H,T,R1),r_dup(R1,R).
r_dup([H|T],[H|R]):-r_dup(T,R).
 
 
goal
is_connected(R).