In the fysical world my graph is representing the polluted nodes are nothing, they are a result of data entry.
The links between the fictional and 'real' nodes in entire path are in the fysical world one and the same thing. So by having this pollution any analytics on the graph (total distance for example for shortest path finding) would yield some proper garbage.
Thanks! I've watched the included video, looks interesting!
I cannot see directly how to use virtual Nodes and Relationships to 'aggregate' these redundant nodes away for now. It looks like adding vNodes will only add more nodes to the graph.
Can you push me in the right direction with an example Cypher query? Or do you need an example dataset to work with? If so, I can try to add one.