Sir, Is there any way we can get the paths between two entities in a semantic graph.
For example, If <a> isA <alphabet> , <b> isA <alphabet> then the path is <a> <-> <alphabet> <-> <b>. Same way for <a> partOf <OddWord> partOf <AllWords> , <a> partOf <EvenWord> partOf <AllWords> .... the path is <a> <-> <OddWord> <-> <AllWords> <-> <EvenWord> <b> Any way we can use semantic query construct to fetch the path like this.. It is a finding paths in a graph as we studies in Data Structures with the context of semantic graphs. -- நன்றி, அருள்.
_______________________________________________ General mailing list [email protected] http://developer.marklogic.com/mailman/listinfo/general
