Hello.
Through Mathematica, I recognized the graph6 format (g6) for storing graphs efficiently. This here http://users.cecs.anu.edu.au/~bdm/data/formats.txt seems to be the main detail explanation about this format. In fact, I couldn't find any other source online. Unfortunately, I don't understand an important step in this guide.
It's the example of the graph6 format. A graph with 5 nodes and edges 0-2, 0-4, 1-3, 3-4 is given. Next, this graph gets the binary string x = 0 10 010 1001 assigned to it. How does this assignment work? I don't get it.
cheers.
Ok. Well, I got it. :-)
All possible edges are: 0-1,0-2,1-2,0-3,1-3,2-3,0-4,1-4,2-4,3-4. If an edge occurs in this list you write 1 and 0 otherwise. Hence, 0-2, 0-4, 1-3, 3-4 results in 0100101001 .
