I have a set of edges like this

{{1:1,1:2},{1:1,2:1}.........}  like this several may be 300 like this or more

i want it to be converted to

{{"1:1","1:2"},{"1:1","2:1"},......}  like inside double qoutes only

kind help

 Kind help Please It will be acknownoleged please please help

The conditions given the below PDF file link Please help it will be greatly acknowleged

to_maple.pdf

I am doing some error I dont know where in the usage

T := [[1, 2], [3, 4]];
convert(T, set, nested);

{[1, 2], [3, 4]}

But I expected internal lists also to be converted to sets like {{1,2},{3,4}}  my list may be a big list just taken a example

This a simple question I know i tried somewhere i am going wrong please help

what i am trying to do is 

n:=8;

k:=2;

C:=choose(n,k);
convert(C,set,nested);
not making all nested all as set as mentioned in the simple example.

some simple program and fast kind help

I have say  I am taking for example purpose only i need in general

v:="1:1":
k:=4

printf("%s]  is %g, v, k) 

Now i want the %s] part in some other color say green or red some dark color.

the %s is inside which need to replaced by the v which will keep coming

I want it for a general say for some part of the printf in some color

At present atleast i want

let F be a function say F(v,k) and it prints out 

printf("%s]  is %g, v, k)  where it prints out the %s] part in dark color

Need help to use DrawGraph to align vertices and edges and length etc for very large large size graph which i want to analyze 

even if the graph even if it requires to writen to a file to make it more big and neatly visible.

kind kind help please it will be acknowledged

Program attached those cartesian product graphs are huge extra parameters and layouts and may others may be required to make such big big graphs visible. Kind help please.

Please help i am not that great on the stylesheet options please please help

Some kind of patterned way to set vertex positions for least crossings in grid form say I am trying but not able to achive kind help.

Any progression type loop based on size number of vertices et.

Graph_draw.mw