Read about crates implementing operations on graphs, but also how graphs are implemented in other languages and the general theory behind it. It's going to be a big feature, so it's important to prepare. In the GAI case I search for an implementation focused on finding nodes which fulfil certain properties, turning them into sets of identifiers which then can be added, substracted, etc., and on traversing graphs from one point to another.
Read about crates implementing operations on graphs, but also how graphs are implemented in other languages and the general theory behind it. It's going to be a big feature, so it's important to prepare. In the GAI case I search for an implementation focused on finding nodes which fulfil certain properties, turning them into sets of identifiers which then can be added, substracted, etc., and on traversing graphs from one point to another.