3 ms·
That depends on your definition of a "plain old graph". If you allow arbitrary numbers of edges between nodes and allow edges to carry data, everything will be
by synae 15y ago
That depends on your definition of a "plain old graph". If you allow arbitrary numbers of edges between nodes and allow edges to carry data, everything will be ok, right? (...right?)
- jerf 15y agoIn math... and we're talking math if we're talking RDF & graphs, right?... "arbitrary" is perilously close to a synonym for "infinite" and "unbounded".
- rgbrgb 15y agoWell, are relationships finite-dimensional?
- bigiain 15y agoThat's true, but "infinite" and "unbounded" often also mean "there's no exact or precise solution, but at least for certain circumstances there's a useful approximation that works". I can calculate pi to "enough" precision, whether I'm making a hula hoop, or a piston ring, or sending a probe to Saturn - I suspect a lot of what I'd like out of a functional "social graph" probably doesn't need much more precision than "three and a bit", 3.1416+-0.0004, or 3.14159265+-0.000000005.