Recalling the essays, this is the non-increasing odometer problem
http://www.jsoftware.com/jwiki/Essays/Nonincreasing%20Odometer
I enjoyed the original solutions.
Subject: [Jprogramming] Generate Complete Graphs
>>> To: "Programming Forum"<[email protected]>
>>> Date: Saturday, September 26, 2015, 10:16 PM
>>>
>>> I have a couple of verbs to represent
>>> a complete (undirected) graph as a list of edges. Clearly
>>> there are "N choose 2" edges that need to be generated.
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
