elated ======
* The program is homologous to [[amiga/development/algorithms/path_traversal/depth-first|the depth-firstpathtraversal program]].
====== Code ======
<file c breadthTra... */
/* Traverses a directory pathbreadth-first starting from an initial */
/* user-supplied ... Amiga OS found at: */
/* http://grimore.org/amiga/development/data_structures/queues/strings */
/* ... */
/* Amiga OS using SAS/C and issuing: sc link breadthTraversal.c */
/*
elated ======
* The program is homologous to [[amiga/development/algorithms/path_traversal/breadth-first|the breadth-firstpathtraversal program]].
====== Code ======
<file c depthTrave... Amiga OS found at: */
/* http://grimore.org/amiga/development/data_structures/stacks/strings */
/* ... */
/* Amiga OS using SAS/C and issuing: sc link depthTraversal.c */
/* ... GLOBAL TEXT version_string[] =
"\0$VER: depthTraversal 1.0 (29 Jul 2015) by Wizardry and Steamworks";
/
~~NOTOC~~
<WRAP round algorithm>
====== Breadth-FirstPathTraversal ======
{{fuss_algorithms_path_traversal_breadth-first.gif}}
===== Algorithm =====
A breadth-firstpath-traversal uses a queue in order to remember directories as it scans. Initiall... ges and $|V|$ is the number of vertices.
====== Implementations =======
* [[amiga/development/algorithms/path_traversal/breadth-first|AmigaOS C]]
</WRAP>
.
</code>
====== Uses ======
* Used for the [[amiga/development/algorithms/path_traversal/breadth-first|breadth-firstpathtraversal program]]
====== Code ======
<file c queues.c>
/... /
/* An implementation of a queue of strings for Amiga OS. */
/* ... */
/* Compile on Amiga OS using SAS/C and issuing: sc link queues.c
For the contact, copyright, license, warranty and privacy terms for the usage of this website please see the
contact,
license,
privacy,
copyright.