We are looking for some in memory graph data kind of solution . Where we can store the graph data like the below
{
"LiftLobby2": {
"Intersection2": 156
},
"Intersection2": {
"NDGate": 232,
"LiftLobby2": 156
},
"NDGate": {
"ND": 24,
"Intersection2": 232
},
"ND": {
"NDGate": 24
},
"LiftLobby1": {
"Intersection1": 156
},
"Intersection1": {
"BDGate": 232,
"LiftLobby1": 156
},
"BDGate": {
"BD": 24,
"Intersection1": 232
},
"BD": {
"BDGate": 24
}
}
The DB solution should have features like:
- Find the smallest path between 2 points.
- Store more than 5000 points and process fast.
- Add restriction between path based on role.
- Add tags for some points if possible. For example Washroom , where we can name 2,3 points as Washroom.
Is there anything available like this or is it better to create our own?