I'm puzzled by the behaviour of this function which I'm running in
AllegroCL. I'm running it as follows against a very small data set. I
know there is more than one path between MajorNode1 and MajorNode2 but
even the "all" version of this function only ever returns a single
shortest path (even when I omit maxiumum-depth):
GENERATOR - (setf nextN (defsna-generator nextNode ()
(:undirected :p (!mp1:hasNextNode))))
SEARCH - (all-bidirectional-search-paths !mp1:MajorNode_1
!mp1:MajorNode_2 nextN)
RESULTS - (({MajorNode_1} {MinorNode_14} {MinorNode_15}
{MinorNode_10} {MinorNode_11} {MajorNode_2}))
#<TRIPLE-STORE::BIDIRECTIONAL-SEARCH-VISITOR @
#x21fa85da>
Am I missing something? I gather from the doco that this should return
more than just the first or shortest path.
Thanks,
Stewart Wallace
_______________________________________________________________________________________________
This email and any files transmitted with it are intended solely for the use of
the addressee(s)
and may contain information that is confidential or subject to legal privilege.
If you receive this
email and you are not the addressee (or responsible for delivery of the email
to the
addressee), please note that any copying, distribution or use of this email is
prohibited
and as such, please disregard the contents of the email, delete the email and
notify the sender
immediately.
_______________________________________________________________________________________________
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"TopBraid Composer Users" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups.google.com/group/topbraid-composer-users?hl=en
-~----------~----~----~----~------~----~------~--~---
