On Monday, January 1, 2018 at 7:57:11 PM UTC-5, Christopher Small wrote:
…you might want to look at Datomic (also authored by Rich Hickey),
> DataScript (an in-memory approximation) or RDF (data language of the
> Semantic Web). They model graphs as `(entity, attribute, value)` triples,
> where
Do you need to be able to attach data to specific edges instances? Or would
it be sufficient to be able to have different types of edges, and be able
to associate data with those abstract edge types?
If the latter, you might want to look at Datomic (also authored by Rich
Hickey), DataScript
€0.02 i like option #3, i think it would be possibly nice for edges to be
named based on the ports they connect.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this group, send email to clojure@googlegroups.com
Note that posts from new
I'm making a little library for myself to represent a kind of graph. I want
to
make it simple, the way Rich Hickey designed much of Clojure. My designs so
far have lacked that kind of plainness and ease of use. I keep wondering,
"What would Rich Hickey do?" Even if you're not Rich Hickey, maybe
Suppose I want to spec a function like run!. run! takes an ifn? and a
‘coll’, where the coll argument may be any reducible collection (so
coll? is really not the right choice, nor is seqable?).
I tried to construct a spec for reducible collections but failed. The
protocol used in reduce is
