React-based web application that enables users to visualize both property graph and RDF data and explore connections between data without having to write graph queries.
Graph Explorer already knows C is neighbors with B, so 1 neighbor is already expanded. So to get the "next" neighbors we skip 1 and take the next 2 neighbors.
The issue is that the database is unaware of what nodes are in the graph and which are not. So the neighbor we skip happens to be A.
Our result includes:
B
D
Since B is already in the graph, we add one new node D to the graph
A -> B -> C -> D
We expand again with our limit of 2. Graph Explorer has 2 neighbors visible. So we skip 2 neighbors and take 2, resulting in:
D
E
Since D is already in the graph, we add one new node E to the graph
A -> B -> C -> D
| -> E
Expanding again with our limit of 2, Graph Explorer has 3 neighbors of C visible. Skip 3 & take 2 results in
E
Which is already in our graph. So nothing appears to happen in the UI.
Environment
OS: macOS
Browser: Arc
Graph Explorer Version: 1.8.0
Graph Database & Version: Amazon Neptune 1.3.2
Steps to Reproduce
Expected Behavior
Limited expansions should always include new neighbors. The full set of neighbors should be able to be expanded if enough expansions occur.
[!IMPORTANT]
If you are interested in working on this issue or have submitted
a pull request, please leave a comment.
[!TIP]
Please use a 👍 reaction to provide a +1/vote.
This helps the community and maintainers prioritize this request.
Description
If we have this simple graph in Graph Explorer
And
C
has the neighbors:A
B
D
E
Now let's say we expand
C
with a limit of 2.Graph Explorer already knows
C
is neighbors withB
, so 1 neighbor is already expanded. So to get the "next" neighbors we skip 1 and take the next 2 neighbors.The issue is that the database is unaware of what nodes are in the graph and which are not. So the neighbor we skip happens to be
A
.Our result includes:
B
D
Since
B
is already in the graph, we add one new nodeD
to the graphWe expand again with our limit of 2. Graph Explorer has 2 neighbors visible. So we skip 2 neighbors and take 2, resulting in:
D
E
Since
D
is already in the graph, we add one new nodeE
to the graphExpanding again with our limit of 2, Graph Explorer has 3 neighbors of
C
visible. Skip 3 & take 2 results inE
Which is already in our graph. So nothing appears to happen in the UI.
Environment
Steps to Reproduce
Expected Behavior
Limited expansions should always include new neighbors. The full set of neighbors should be able to be expanded if enough expansions occur.