Not logged in. · Lost password · Register

Member since Oct 2018
8 posts
Subject: Problem 3.1 - expansion order
I'm not quite sure I understand the description of problem 3.1 correctly. A DFS for example would not expand left-recursively but follow the alphabetical order?
E.g. A->B->C instead of A->B->D ?
Member since Oct 2019
86 posts
The problem asks that you use alphabetical order when no other order is specified by the search. In the case of DFS, the order is always specified by search, i.e., left-recursively.
I hope this helps!
Member since Oct 2018
8 posts
Yes, that helps. Thank you.
Close Smaller – Larger + Reply to this post:
Verification code: VeriCode Please enter the word from the image into the text field below. (Type the letters only, lower case is okay.)
Smileys: :-) ;-) :-D :-p :blush: :cool: :rolleyes: :huh: :-/ <_< :-( :'( :#: :scared: 8-( :nuts: :-O
Special characters:
Go to forum
Datenschutz | Kontakt
Powered by the Unclassified NewsBoard software, 20150713-dev, © 2003-2011 by Yves Goergen