
Testing Picasa 3 Linux Blogger support.
By the way, this graph represents three ways to represent directed, labeled graphs whose edge labels are from the same set as its vertices.
The red graph shows the way I prefer to do it: label the edge with the name of the vertex. The problem with that is that it doesn't clearly show the contents of that vertex, just the name.
The green way is an ugly way I came up with. One problem with it is that it's possible to fake inodes if you have access to the ptr, dest, and path symbols.
The blue way treats it as a relation and ignores the functional dependency. It recognizes that a relation is a subset of the cartesian product of the schema, and so it holds a sparse three-level index into the cartesian product with booleans stored at the leaves. A problem with it is that it doesn't preserve the functional dependency.
Another view not demonstrated here is to have a filesystem. The source is the name of the directory, the path is the name of the file in that directory, and the destination is the contents of the file.
Still another way is a sparse, unbounded spreadsheet. This representation most closely matches the model I want.