search

EmmanuelOga / hypergraphdb

Automatically exported from code.google.com/p/hypergraphdb
1 stars 0 forks source link

Hyper-Traversals #24

Open GoogleCodeExporter opened 9 years ago

GoogleCodeExporter commented 9 years ago 
A normal, "flat" traversal is based on a standard, flat graphs: each node has 
a set of neighbors that are directly linked to it. When links contain more 
than two nodes, this just yields more neighbors per link, but the structure 
is still flat. However, when links contain other links, the structure is no 
longer. A traversal might need to follow that links that it visits. 
Conversely, a traversal might need to visit the links that it follows to 
discover neighbors. What does breadth-first/depth-first mean in this context 
is not very clear to me because we have more dimensions (i.e. more ways to go 
at each step). 

An API needs to be worked out for defining hyper-traversals and see what kind 
of algorithms can be build on top of them.

Original issue reported on code.google.com by borislav...@gmail.com on 4 Jul 2009 at 5:22

GoogleCodeExporter commented 9 years ago 
I assume this has been resolved?

Original comment by *bcru...@benchmarkconsulting.com on 21 Feb 2011 at 2:48

GoogleCodeExporter commented 9 years ago 
Not really. There's a HyperTraversal class defined with limited functionality 
that was needed in one particular case, but a fully general framework for 
hyper-traversing is yet to be specified. If you have some ideas on how to 
define a nice, simple yet powerful API for hyper-traversals, please share them! 
:)

Original comment by borislav...@gmail.com on 22 Feb 2011 at 3:18