Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Welcome To Ask or Share your Answers For Others

Categories

0 votes
964 views
in Technique[技术] by (71.8m points)

combinations - Do all permutatuions of list of tuples while dont exist repetitions PROLOG

I want do all combination of a list of tuples whule dont existe 2 equals to check the ambiguity, like:

[(a,[0]),(b,[1]),(c,[0,1])]
L= a,[0]
L= b,[1]
L= c,[0,1]
L= aa,[0,0]
L= ab,[0,1]

STOP BECAUSE ab,[0,1] = c,[0,1]
and return:
M=[0,1]
M1 = c
M2= ab
question from:https://stackoverflow.com/questions/65943584/do-all-permutatuions-of-list-of-tuples-while-dont-exist-repetitions-prolog

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
Welcome To Ask or Share your Answers For Others

1 Reply

0 votes
by (71.8m points)
Waitting for answers

与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…
OGeek|极客中国-欢迎来到极客的世界,一个免费开放的程序员编程交流平台!开放,进步,分享!让技术改变生活,让极客改变未来! Welcome to OGeek Q&A Community for programmer and developer-Open, Learning and Share
Click Here to Ask a Question

...