The graph-traversal tag has no wiki summary.
-2
votes
0answers
135 views
General tree traversal in breadth-first search manner [closed]
I have a Tree Structure where each node has 5 child nodes and more than that are not allowed. I wish to traverse this tree in breadth-first search manner.
Now I wish to calculate empty node from ...
4
votes
4answers
521 views
Usefulness of pre and post order traversal of binary trees
This may be very naive, but I was wondering, it the context of binary trees (plain, sorted and balanced), of all the traversal types:
depth-first pre-order
depth-first in-order
depth-first ...
2
votes
1answer
344 views
Architecture for Social Graph data that has a Time Frame Associated?
I am adding some "social" type features to an existing application. There are a limited # of node & edge types. Overall the data itself is relatively small (50,000 - 70,000 for each type of ...
6
votes
5answers
325 views
Finding an A* heuristic for a directed graph
In a previous question, I asked about finding a route (or path if you will) in a city. That is all dandy. The solution I chose was with the A* algorithm, which really seems to suit my needs. What I ...
0
votes
2answers
161 views
Algorithm for searching the neighbors neighbor of a directed graph
Is there an algorithm to search a directed graph (tree) for its neighbors neighbor?
My current brute-force solution works as follows:
for each node n:
for each child c of n
for each parent ...
1
vote
1answer
310 views
Gremlin — do I have to know Java/Groovy
This is the excerpt from the project's Github page.
Gremlin provides graph traversal related syntactic sugar to Groovy. Groovy provides dynamic language syntactic sugar to Java. Realize that ...
