Open bitnom opened 8 months ago
Once https://github.com/dao-xyz/peerbit/pull/278 is done then there will be a efficient index for searches, so in theory with that you can at least efficiently find nodes that ful-fill certain criterias (like getting all neighbours or edges to a node) and iterate on graphs with that. But how will this will suit you depends on what requirements you have, like how many nodes, edges, weighted (?) and if you are to run specific graph algorithms etc.
Has any effort been made towards edges, and graph search? I'm basically looking for an alternative to gun.