Tag Archives: traversals

DEX 3.0 features: Neighbors materialized

One common challenge when traversing a graph is to obtain the neighbors for a certain node. In previous versions of DEX it required a two-step operation; first obtaining the edges for the node and then its neighbors. Objects neighbors = … Continue reading

Posted in DEX, Documentation | Tagged , , , , , , , | Leave a comment

DEX 3.0 features: Graph algorithms

Starting today we are going to make a series of posts explaining the most exciting features of the last available version of DEX. We hope that these explanations will give you a hint on the powerful possibilities of DEX. If … Continue reading

Posted in DEX, Documentation | Tagged , , , , , , , , , , , | 7 Comments