Bfs - A breadth-first version of find

I'm writing a breadth-first version of find. It's available on the AUR(4), and the code is on GitHub.
Currently it doesn't support any of find's options, but I plan to add support for the common ones. It does support a "-nohidden" flag that filters out dotfiles, something surprisingly difficult to do with find. It also supports colorization, respecting LS_COLORS.
The reason I'm writing it is mainly to integrate it with fzf, a terminal fuzzy finder. fzf uses find by default, which means it will often fully explore a very deep directory tree before reaching the nearby file I'm looking for. bfs ensures that shallower files always show up before deeper ones, which usually means it finds the file I want sooner. The colorization is also nice:
$ bfs -color -nohidden | fzf --ansi
Last edited by tavianator (2015-06-20 04:42:39)

ChangBroot wrote:
All the lectures I have read in the net are talking about Queue, but my problem is reading the tree in BFS Traversal order. It's almost 4 days I'm trying to solve this probelm, but can't come up with something. Any help is greatly appreciated. One simple strategy is to make an ordinary recursive traversal of the tree. Along in the traversal you keep an array of linked lists. When you visit a node you just add it to the list at the entry in the array corresponding to the depth of this node.
After the traversal you have an array with linked lists. Each list holds the nodes found at a certain tree depth. So each list holds all nodes corresponding to a specific tree "breadth", namely all nodes found at the same tree depth.

Similar Messages

Ok, so I have a PC and recently downloaded the newest version of iTunes. Somehow I canno't find my video Podcasts anywhere except for the recently played videos. Where can I first of all find them and secondly view them like in a list or gallery?

Ok, so I have a PC and recently downloaded the newest version of iTunes. Somehow I canno't find my video Podcasts anywhere except for the recently played videos. Where can I first of all find them and secondly view them like in a list or gallery?

replying to JS1111
Now I only get one HKEYLOCALMACHINE\Software\
QuicktimePlayerLib.QuicktimePlayerApp\CLSID.
some folks have been having some success with pgfpdwife's technique in the following post:
pgfpdwife: Re: Could not open key HKEYLOCALMACHINE\Software\Classic\Quicktime.Quicktime\
note carefully that the technique involves a registry edit. be sure to make a backup of any keys you edit. if you're unfamiliar with your registry or registry editing, head to your XP help and support, do a search on registry, and read through the articles that come up.
There are also some instructions on how to back up registry keys in the following document:
Error 1406 or 1402 appears when you install iTunes or QuickTime for Windows

Breadth First Search (More of a Logic Question)

Hey guys, I'm having a logic block with a Breadth First Search using a queue.
Basically the way Breadth First Search works is that it expands all of the nodes one level at a time until it finds the result. I quickly whipped out a flash to demonstrate what I believe is the Breadth First Search.
http://www.nxsupport.com/dimava/bfs.swf
I wrote the code to do the algorithm, However if I just output the queue it shows all of the excess "potential" nodes and not just the direct route. For example, with the flash file linked above, it would show ABECGFC, instead of just ABCD.
I realise that I could trace back from the end to see which of the nodes D is connected to, then which of the nodes C is connected to, etc. But that wouldn't work out if there was more than one path with the same distance leading to the same destination.
Thanks,
Dimava

It's been a long time since college so I may be suggesting a poor way of doing this.
But suppose you have a queue data type. You can use it in two ways: as a representation of a path from your starting node to your ending node, and as a place to hold paths while you're performing a breadth-first search. (Or you could skip the latter and just use recursion.)
You wouldn't keep a list of all possible paths. Rather you'd be storing paths that correspond to nodes currently being examined in your breadth-first search.
So you'd create a queue (representing a path) holding your start node. Then you'd put that queue into the queue that represents your traversal state.
Then while the traversal queue is not empty, you take out a path (a queue), look at its last element (a node), then create new paths that consist of the current path but each terminating with one of the children of the current node. (Well not really children since it's a graph and not a tree, but you know what I mean.) Repeat until the target node is found.

Depth First Search, Breadth First Search

BANNER
Oracle Database 10g Enterprise Edition Release 10.2.0.5.0 - Prod
PL/SQL Release 10.2.0.5.0 - Production
CORE     10.2.0.5.0     Production
TNS for Linux: Version 10.2.0.5.0 - Production
NLSRTL Version 10.2.0.5.0 - Production
I
have this table that form a tree where record with column value 'more_left' 0 is located more left than 1 (for example, record with id 2 has a parent id 1 and more left than record with id 7 that also has parent id 1):
with t as(
select 2 id,1 parent_id,0 most_left from dual
union all
select 7 id,1 parent_id,1 most_left from dual
union all
select 8 id,1 parent_id,2 most_left from dual
union all
select 3 id,2 parent_id,0 most_left from dual
union all
select 6 id,2 parent_id,1 most_left from dual
union all
select 9 id,8 parent_id,0 most_left from dual
union all
select 12 id,8 parent_id,1 most_left from dual
union all
select 4 id,3 parent_id,0 most_left from dual
union all
select 5 id,3 parent_id,1 most_left from dual
union all
select 10 id,9 parent_id,0 most_left from dual
union all
select 11 id,9 parent_id,1 most_left from dual
select * from t;The problem is to show all the ids, using Breadth First Search and Depth First Search. Tx, in advance.
Edited by: Red Penyon on Apr 12, 2012 3:39 AM

Hi,
I fail to understand how comes there is no row for ID=1 ?
The topmost parent (the root) should be in the table also.
For 11g, this would work (as long as the root is in the table) :Scott@my11g SQL>l
1 WITH t AS
2       (SELECT 1 ID, 0 parent_id, 0 most_left
3          FROM DUAL
4        UNION ALL
5        SELECT 2 ID, 1 parent_id, 0 most_left
6          FROM DUAL
7        UNION ALL
8        SELECT 7 ID, 1 parent_id, 1 most_left
9          FROM DUAL
10        UNION ALL
11        SELECT 8 ID, 1 parent_id, 2 most_left
12          FROM DUAL
13        UNION ALL
14        SELECT 3 ID, 2 parent_id, 0 most_left
15          FROM DUAL
16        UNION ALL
17        SELECT 6 ID, 2 parent_id, 1 most_left
18          FROM DUAL
19        UNION ALL
20        SELECT 9 ID, 8 parent_id, 0 most_left
21          FROM DUAL
22        UNION ALL
23        SELECT 12 ID, 8 parent_id, 1 most_left
24          FROM DUAL
25        UNION ALL
26        SELECT 4 ID, 3 parent_id, 0 most_left
27          FROM DUAL
28        UNION ALL
29        SELECT 5 ID, 3 parent_id, 1 most_left
30          FROM DUAL
31        UNION ALL
32        SELECT 10 ID, 9 parent_id, 0 most_left
33          FROM DUAL
34        UNION ALL
35        SELECT 11 ID, 9 parent_id, 1 most_left
36          FROM DUAL
37 )
38 select
39 rt
40 ,listagg(id,'-') within group (order by lvl,id) BFS
41 ,listagg(id,'-') within group (order by pth,lvl) DFS
42 from (
43 SELECT id, connect_by_root(id) rt, sys_connect_by_path(most_left,'-') pth, level lvl, most_left
44        FROM t
45 CONNECT by nocycle prior ID = parent_id
46 START WITH parent_id = 0
47 )
48* group by rt
Scott@my11g SQL>/
        RT BFS                            DFS
         1 1-2-7-8-3-6-9-12-4-5-10-11     1-2-3-4-5-6-7-8-9-10-11-12But as long as you're 10g, that is no real help.
I'll try to think of a way to get that with 10g.
10g solution for DFS :Scott@my10g SQL>l
1 WITH t AS
2 (
3      SELECT 1 ID, 0 parent_id, 0 most_left FROM DUAL UNION ALL
4      SELECT 2 ID, 1 parent_id, 0 most_left FROM DUAL UNION ALL
5      SELECT 7 ID, 1 parent_id, 1 most_left FROM DUAL UNION ALL
6      SELECT 8 ID, 1 parent_id, 2 most_left FROM DUAL UNION ALL
7      SELECT 3 ID, 2 parent_id, 0 most_left FROM DUAL UNION ALL
8      SELECT 6 ID, 2 parent_id, 1 most_left FROM DUAL UNION ALL
9      SELECT 9 ID, 8 parent_id, 0 most_left FROM DUAL UNION ALL
10      SELECT 12 ID, 8 parent_id, 1 most_left FROM DUAL UNION ALL
11      SELECT 4 ID, 3 parent_id, 0 most_left FROM DUAL UNION ALL
12      SELECT 5 ID, 3 parent_id, 1 most_left FROM DUAL UNION ALL
13      SELECT 10 ID, 9 parent_id, 0 most_left FROM DUAL UNION ALL
14      SELECT 11 ID, 9 parent_id, 1 most_left FROM DUAL
15 )
16 select max(pth) DFS
17 from (
18 select sys_connect_by_path(id,'-') pth
19 from (
20 select id,pth,lvl,most_left, row_number() over (order by pth, lvl) rn
21 from (
22 select id, sys_connect_by_path(most_left,'-') pth, level lvl, most_left
23 from t
24 CONNECT by nocycle prior ID = parent_id
25 START WITH parent_id = 0
26 )
27 order by pth, lvl
28 )
29 connect by prior rn= rn-1
30 start with rn=1
31* )
Scott@my10g SQL>/
DFS
-1-2-3-4-5-6-7-8-9-10-11-12------
10g solution for BFS :Scott@my10g SQL>l
1 WITH t AS
2 (
3      SELECT 1 ID, 0 parent_id, 0 most_left FROM DUAL UNION ALL
4      SELECT 2 ID, 1 parent_id, 0 most_left FROM DUAL UNION ALL
5      SELECT 7 ID, 1 parent_id, 1 most_left FROM DUAL UNION ALL
6      SELECT 8 ID, 1 parent_id, 2 most_left FROM DUAL UNION ALL
7      SELECT 3 ID, 2 parent_id, 0 most_left FROM DUAL UNION ALL
8      SELECT 6 ID, 2 parent_id, 1 most_left FROM DUAL UNION ALL
9      SELECT 9 ID, 8 parent_id, 0 most_left FROM DUAL UNION ALL
10      SELECT 12 ID, 8 parent_id, 1 most_left FROM DUAL UNION ALL
11      SELECT 4 ID, 3 parent_id, 0 most_left FROM DUAL UNION ALL
12      SELECT 5 ID, 3 parent_id, 1 most_left FROM DUAL UNION ALL
13      SELECT 10 ID, 9 parent_id, 0 most_left FROM DUAL UNION ALL
14      SELECT 11 ID, 9 parent_id, 1 most_left FROM DUAL
15 )
16 select max(pth) BFS
17 from (
18 select sys_connect_by_path(id,'-') pth
19 from (
20 select id,pth,lvl,most_left, row_number() over (order by lvl, pth) rn
21 from (
22 select id, sys_connect_by_path(most_left,'-') pth, level lvl, most_left
23 from t
24 CONNECT by nocycle prior ID = parent_id
25 START WITH parent_id = 0
26 )
27 order by lvl, pth
28 )
29 connect by prior rn= rn-1
30 start with rn=1
31* )
Scott@my10g SQL>/
BFS
-1-2-7-8-3-6-9-12-4-5-10-11There might certainly have better ways...

Breadth First Traversal of a Tree...

Hi,
I want to make a program to print every node of a tree in a Breadth First Search (BFS)/Traversal. Since, BFS searches a tree in levels (i.e. 1st the root, then it's Children, then Grand Children etc from left to right), this is where I'm stuck. Here is my TreeNode class:
class TreeNode {
Object element;
TreeNode left;
TreeNode right;
public TreeNode(Object o) {
    element = o;
}Each node has a reference to its Children nodes etc. Here is how my tree looks like. Mine is similar to this: http://www.codeproject.com/KB/vb/SimpleBTree.aspx
All the lectures I have read in the net are talking about Queue, but my problem is reading the tree in BFS Traversal order. It's almost 4 days I'm trying to solve this probelm, but can't come up with something. Any help is greatly appreciated.
Here is my Binary Tree class:
public class BinaryTree {
     private TreeNode root;
     private int size = 0;
     /** Create a default binary tree */
     public BinaryTree() {
     /** Create a binary tree from an array of objects */
    public BinaryTree(Object[] objects) {
      for (int i = 0; i < objects.length; i++)
        insert(objects);
/** Insert element o into the binary tree
* Return true if the element is inserted successfully */
public boolean insert(Object o) {
if (root == null)
root = new TreeNode(o); // Create a new root
else {
// Locate the parent node
TreeNode parent = null;
TreeNode current = root;
while (current != null)
if (((Comparable)o).compareTo(current.element) < 0) {
parent = current;
current = current.left;
else if (((Comparable)o).compareTo(current.element) > 0) {
parent = current;
current = current.right;
else
return false; // Duplicate node not inserted
// Create the new node and attach it to the parent node
if (((Comparable)o).compareTo(parent.element) < 0)
parent.left = new TreeNode(o);
else
parent.right = new TreeNode(o);
size++;
return true; // Element inserted
/** Inorder traversal */
public void inorder() {
inorder(root);
/** Inorder traversal from a subtree */
private void inorder(TreeNode root) {
if (root == null) return;
inorder(root.left);
System.out.print(root.element + " ");
inorder(root.right);
/** Postorder traversal */
public void postorder() {
postorder(root);
/** Postorder traversal from a subtree */
private void postorder(TreeNode root) {
if (root == null) return;
postorder(root.left);
postorder(root.right);
System.out.print(root.element + " ");
/** Preorder traversal */
public void preorder() {
preorder(root);
/** Preorder traversal from a subtree */
private void preorder(TreeNode root) {
if (root == null) return;
System.out.print(root.element + " ");
preorder(root.left);
preorder(root.right);
/** Inner class tree node */
private static class TreeNode {
Object element;
TreeNode left;
TreeNode right;
public TreeNode(Object o) {
element = o;
/** Get the number of nodes in the tree */
public int getSize() {
return size;
/** Search element o in this binary tree */
public boolean search(Object o){
TreeNode temp = root;
boolean found = false;
if(temp == null)
found = false;
else if(((Comparable)(temp.element)).compareTo(o) == 0 && temp != null)
found = true;
else if(((Comparable)temp.element).compareTo(o) > 0){
root = temp.left;
found = search(o);
else{
root = temp.right;
found = search(o);
return found;
/** Display the nodes in breadth-first traversal */
public void breadthFirstTraversal(){
TreeNode temp = root;
// TreeNode leftChild = temp.left;
// TreeNode rightChild = temp.right;
MyQueue s = new MyQueue();
s.enqueue(root);
// while (s.getSize() == 0){
System.out.println(s);
// private void breadthFirstTraversal(TreeNode node){

ChangBroot wrote:
All the lectures I have read in the net are talking about Queue, but my problem is reading the tree in BFS Traversal order. It's almost 4 days I'm trying to solve this probelm, but can't come up with something. Any help is greatly appreciated. One simple strategy is to make an ordinary recursive traversal of the tree. Along in the traversal you keep an array of linked lists. When you visit a node you just add it to the list at the entry in the array corresponding to the depth of this node.
After the traversal you have an array with linked lists. Each list holds the nodes found at a certain tree depth. So each list holds all nodes corresponding to a specific tree "breadth", namely all nodes found at the same tree depth.

When to go for Breadth first search over depth first search

hi,
under which scenarios breadth first search could be used and under which scenarios depth first search could be used?
what is the difference between these two searches?
Regards,
Ajay.

No real clear-cut rule for when to use one over the other. It depends on the nature of your search and where you would prefer to find results.
The difference is that in breadth-first you first search all immidiate neighbours before searching their neighbours (sort of like preorder traversal). Whereas in depth-first you search some random (or otherwise selected) neighbour and then a neighbour of that node until you can't go deeper (i.e., you've searched a neighbour that has no other neighbours). This probably isn't a very clear explanation, perhaps you'll find this more helpful: http://www.ics.uci.edu/~eppstein/161/960215.html
If you would prefer to find results closer to the origin node, breadth first would be better. If you would prefer to find results further away use depth first.

[svn:cairngorm3:] 16446: First version of Spring ActionScript extension to Navigation lib, minor refactorings on Parsley and Swiz extensions and samples.

Revision: 16446
Revision: 16446
Author:   [email protected]
Date:     2010-06-03 14:09:00 -0700 (Thu, 03 Jun 2010)
Log Message:
First version of Spring ActionScript extension to Navigation lib, minor refactorings on Parsley and Swiz extensions and samples.
Modified Paths:
    cairngorm3/trunk/libraries/NavigationSpringAS/.actionScriptProperties
    cairngorm3/trunk/libraries/NavigationSpringAS/.flexLibProperties
    cairngorm3/trunk/libraries/NavigationSpringAS/src/com/adobe/cairngorm/navigation/landmark /AbstractNavigationProcessor.as
    cairngorm3/trunk/libraries/NavigationSpringAS/src/com/adobe/cairngorm/navigation/landmark /LandmarkProcessor.as
    cairngorm3/trunk/libraries/NavigationSpringAS/src/com/adobe/cairngorm/navigation/waypoint /WaypointProcessor.as
Added Paths:
    cairngorm3/trunk/libraries/NavigationSpringAS/src/com/adobe/cairngorm/navigation/core/Pro cessorFilter.as

I am getting this same issue. Did you ever find a fix for this?

[svn:cairngorm3:] 16449: First version of Spring ActionScript extension to Navigation lib, minor refactorings on Parsley and Swiz extensions and samples.

Revision: 16449
Revision: 16449
Author:   [email protected]
Date:     2010-06-03 14:34:18 -0700 (Thu, 03 Jun 2010)
Log Message:
First version of Spring ActionScript extension to Navigation lib, minor refactorings on Parsley and Swiz extensions and samples.
Modified Paths:
    cairngorm3/trunk/libraries/NavigationSpringAS/src/com/adobe/cairngorm/navigation/core/Pro cessorFilter.as
    cairngorm3/trunk/libraries/NavigationSpringAS/src/com/adobe/cairngorm/navigation/landmark /AbstractNavigationProcessor.as
    cairngorm3/trunk/libraries/NavigationSpringAS/src/com/adobe/cairngorm/navigation/landmark /LandmarkProcessor.as
    cairngorm3/trunk/libraries/NavigationSpringAS/src/com/adobe/cairngorm/navigation/waypoint /WaypointProcessor.as
Added Paths:
    cairngorm3/trunk/libraries/NavigationSpringAS/src/com/adobe/cairngorm/navigation/core/Met adataUtil.as

I am getting this same issue. Did you ever find a fix for this?

[svn:cairngorm3:] 16445: First version of Spring ActionScript extension to Navigation lib, minor refactorings on Parsley and Swiz extensions and samples.

Revision: 16445
Revision: 16445
Author:   [email protected]
Date:     2010-06-03 13:44:03 -0700 (Thu, 03 Jun 2010)
Log Message:
First version of Spring ActionScript extension to Navigation lib, minor refactorings on Parsley and Swiz extensions and samples.
Modified Paths:
    cairngorm3/trunk/libraries/NavigationSpringAS/src/com/adobe/cairngorm/navigation/waypoint /DestinationRegistrationWithWaypointHandler.as

I am getting this same issue. Did you ever find a fix for this?

Depth/Breadth First Search

Hello all,
I am trying to figure out how to do a depth and breadth first search on a graph of Cities, as defined below. I think that I understand the searches, but I am having an extremely difficult time figuring out how to implement them.
If anyone has any tips, suggestions, or hints (for some reason I think I'm probably just overlooking something simple), I would greatly appreciate them.
Thanks for any help!
* to represent an individual city
public class City {
    String name;
    double latitude;
    double longitude;
    ArrayList<Edge> neighbors;
    //the constructor
    public City(String name, double latitude, double longitude){
        this.name = name;
        this.latitude = latitude;
        this.longitude = longitude;
        this.neighbors = new ArrayList<Edge>();
    //to check if this city is equal to that given city
    public boolean same(City c){
        return this.name.equals(c.name) && this.latitude == c.latitude &&
            this.longitude == c.longitude;
* to represent an edge between two cities
public class Edge {
    City city1;
    City city2;
    double dist;
    boolean visited;
    public Edge(City city1, City city2){
        this.city1 = city1;
        this.city2 = city2;
        this.dist = this.distTo();
        this.visited = false;
     * to find the distance between the two cities in an edge
    public double distTo(){
        return Math.sqrt(((this.city1.latitude - this.city2.latitude) *
                (this.city1.latitude - this.city2.latitude)) +
                ((this.city1.longitude - this.city2.longitude) *
                (this.city1.longitude - this.city2.longitude)));
* to represent a path between two cities as a list
* of edges
public class Graph {
    ArrayList<Edge> alist;
    public Graph(ArrayList<Edge> alist){
        this.alist = alist;
}

http://en.wikipedia.org/wiki/Breadth-first_search (includes algorithm)

Where do I get the first version of creative recorder for my Soundblaster Live! Platin

Hi there,
I would like to install the 2.00.34 version, but first I need the first version.
I cannot find it in the download area.
greetz!!!

This is because the directions you are seeing are out of date. They applied to Firefox < 10.
The only way to get data out of the Firefox for Android profile is to use https://addons.mozilla.org/en-US/android/addon/copy-profile/
This data is not directly importable into Firefox desktop. It would require some inspection of the SQLite databases to accomplish what you want to do.

I just updated my pages and now it won't load. This is on my iPad. The first version which has the latest version it can have 5.1 or something like that. I am trying to open a document and am worried that if I uninstall and reinstall I will lose all my do

I just updated my pages and now it won't load. This is on my iPad. The first version which has the latest version it can have 5.1 or something like that. I am trying to open a document and am worried that if I uninstall and reinstall I will lose all my documents

I just uninstalled it and am waiting for it to reinstall. I sincerely hope that I have not lost everything that I worked on so hard. Now that mobile me is gone, I have not been able to go between devices to transfer things. I was merely trying to take a document I had worked on and open it in pages, but it said my version was too old. When I updated, it wouldn't load. Now I cannot do anything. I hope that the reinstall fixes it without losing everything. Please advise!!! Yes, I am in panic mode.

I have the first version iPhone. Recently, I tried to edit several old notes. I open the note, touch the trash can, touch "delete note", and it goes back to my applications screen; I go back into Notes, and the note supposedly deleted is still there.

I have a first version iPhone. Having problem with Notes. There are four notes that I want to delete and have tried everything I can think of; they won'y move to trash; I delete the text to a blank page but when I go backa to notes the title is still there and it opens with the undeleted test etc, etc. And it won't save new notes. What can I do other than get a newer iPhone? Notes on my iPad works just fine.
Pat

Try:
- iOS: Not responding or does not turn on
- Also try DFU mode after try recovery mode
How to put iPod touch / iPhone into DFU mode « Karthik's scribblings
- If not successful and you can't fully turn the iOS device fully off, let the battery fully drain. After charging for an least an hour try the above again.
- Try another cable
- Try on another computer
- If still not successful that usually indicates a hardware problem and an appointment at the Genius Bar of an Apple store is in order.
Apple Retail Store - Genius Bar
The missing apps could have been done by setting the Restrictions that can hid those apps. If the backup was made with those retrictions set the the Restrictions are also restored.
Thus, if you get it to work restore to factory settings/new iPod, not from backup
You can redownload most iTunes purchases by:
Downloading past purchases from the App Store, iBookstore, and iTunes Store

How do you transfer Apple IDs from one ipad to another iPad? I got the new ipad and gave my ipad 2 to my wife who had the first version and now I can't get my Apple ID off so she can use her Apple ID.

how do you transfer Apple IDs from one ipad to another iPad? I got the new ipad and gave my ipad 2 to my wife who had the first version and now I can't get my Apple ID off so she can use her Apple ID.

You don't transfer Apple ID's from one device to another one. You sign out in the settings, )the App Store and iTunes if necessary) and then sign in with the other ID.
Settings>iTunes & App Stores>Apple ID>Sign out. Them sign in with the other ID. You can sign out of the app store and iTunes as well by going to the featured Atab in the App Store and the music tab in iTunes, swipe to the bottom and access the Apple ID in there.
You should have erased the iOad before you gave it to her in Settings>General>Reset>Erase all content and settings. That way she could set up the iPad as new with her own Apple ID.
Be aware of the fact that if you use each others ID's in order to download past purchased content to your own iPads, you will lock yourself out of your own ID as you will have associated your iPad with the other person's Apple ID.
In other words, if you sign into your wife's ID on your iPad so that you can download an app or an album so that you don't have to pay for it again, you will lock yourself out of your Apple ID for 90 days.

What is the list of file prefixes that make a file appear first in the finder?

Hi!
I was just curious :
What is the list of file prefixes that make a file appear first in the finder?
For example, files and folders whose names start with "A" will appear before files whose names start with "B",
but what about a list of characters for files and folders before the letter "A"?
I'm doing some file organisation, and I need certain things to appear at the top of the list.
I have noticed that the character-prefixes "0" and "(" seem to make things appear before "A"
I would like a complete list if there is one available.
Thank you!

Pretty much any number or a space character. Punctuation does too, in theory, but I'd advise to limit it to hyphens and underscores. Periods are OK in the middle of file names but you won't be able to start a file name with one at the Finder level since that would actually hide the file.
Matt

Bfs - A breadth-first version of find

Similar Messages

Maybe you are looking for