c++实现广度优先和深度优先查找目录结构
2014-06-06 15:22
501 查看
//************************************
// Method: 深度优先法实现扫描目录, 使用递归方式
// FullName: CScanDirectoryDlg::ScanDirectoryByDeep
// Access: public static
// Returns: int 返回历时
// Parameter: CString& csTextOut [out]
// Parameter: LPCTSTR pszRoot
//************************************
unsigned long ScanDirectoryByDeep( CString& csTextOut, LPCTSTR pszRoot, int nDeep )
{
CString csFileList;
CFileFind finder;
unsigned long nTimeSpan = 0;
if (0 == nDeep)
{
nTimeSpan = GetCurTimeStamp();
}
// build a string with wildcards
CString csDir(pszRoot);
// start working for files
BOOL bWorking = finder.FindFile(csDir + _T("\\*.*"));
//遍历csDir目录下的文件和子目录
while (bWorking)
{
bWorking = finder.FindNextFile();
// skip . and .. files; otherwise, we'd
// recur infinitely!
if (finder.IsDots())
{
continue;
}
CString csFileOrDir = finder.GetFilePath();
// if it's a directory
if (finder.IsDirectory())
{
ScanDirectoryByDeep(csTextOut, csFileOrDir, nDeep + 1);
csTextOut.AppendFormat(_T("[%u-D]%s\r\n"), nDeep, csFileOrDir);
}
else //it's a file
{
csFileList.AppendFormat(_T("[%u-F]%s\r\n"), nDeep, csFileOrDir);
}
}
finder.Close();
//将文件名附进来
csTextOut += csFileList;
//根层进入时统计时间
if (0 == nDeep)
{
nTimeSpan = GetCurTimeStamp() - nTimeSpan;
}
return nTimeSpan;
}
//************************************
// Method: 实现广度扫描
// FullName: CScanDirectoryDlg::ScanDirectoryByBreadth
// Access: public static
// Returns: unsigned long 返回历时
// Parameter: CString & csTextOut
// Parameter: LPCTSTR pszRoot
// Parameter: int nDeep 层次 (目录层次输出暂未实现)
//************************************
unsigned long ScanDirectoryByBreadth( CString& csTextOut, LPCTSTR pszRoot, int nDeep )
{
// 搜索该路径下的文件
deque<CString> deDirectory;
CFileFind finder;
BOOL bWorking;
unsigned long nTimeSpan;
nTimeSpan = GetCurTimeStamp(); //time count start
CString csDir(pszRoot);
nDeep = 0;
bWorking = finder.FindFile(csDir + _T("\\*.*"));
while (bWorking)
{
bWorking = finder.FindNextFile();
// skip . and .. files;
if (finder.IsDots())
{
continue;
}
// if it's a directory
CString strSubDir = finder.GetFilePath();
if (finder.IsDirectory())
{
csTextOut.AppendFormat(_T("[%u-D]%s\r\n"), nDeep, strSubDir);//记录下文件目录名
deDirectory.push_back(strSubDir);
}
else //it's a file
{
csTextOut.AppendFormat(_T("[%u-F]%s\r\n"), nDeep, strSubDir); // 记录下文件名
}
}
// 寻找一级目录下的子目录或文件
++nDeep;
while(!deDirectory.empty())
{
std::deque<CString>::iterator it = deDirectory.begin();
CFileFind finder;
BOOL bWorking = finder.FindFile((*it) + _T("\\*.*"));
while(bWorking)
{
bWorking = finder.FindNextFile();
if (finder.IsDots())
{
continue;
}
// if it's a directory
CString csFileOrDir = finder.GetFilePath();
if (finder.IsDirectory())
{
csTextOut.AppendFormat(_T("[%u-D]%s\r\n"), nDeep, csFileOrDir); //记录下文件目录名
deDirectory.push_back(csFileOrDir);
}
else //it's a file
{
csTextOut.AppendFormat(_T("[%u-D]%s\r\n"), nDeep, csFileOrDir); // 记录下文件名
}
}
// 删除队列的头元素
deDirectory.pop_front();
}
nTimeSpan = GetCurTimeStamp() - nTimeSpan; //time count end
return nTimeSpan;
}
// Method: 深度优先法实现扫描目录, 使用递归方式
// FullName: CScanDirectoryDlg::ScanDirectoryByDeep
// Access: public static
// Returns: int 返回历时
// Parameter: CString& csTextOut [out]
// Parameter: LPCTSTR pszRoot
//************************************
unsigned long ScanDirectoryByDeep( CString& csTextOut, LPCTSTR pszRoot, int nDeep )
{
CString csFileList;
CFileFind finder;
unsigned long nTimeSpan = 0;
if (0 == nDeep)
{
nTimeSpan = GetCurTimeStamp();
}
// build a string with wildcards
CString csDir(pszRoot);
// start working for files
BOOL bWorking = finder.FindFile(csDir + _T("\\*.*"));
//遍历csDir目录下的文件和子目录
while (bWorking)
{
bWorking = finder.FindNextFile();
// skip . and .. files; otherwise, we'd
// recur infinitely!
if (finder.IsDots())
{
continue;
}
CString csFileOrDir = finder.GetFilePath();
// if it's a directory
if (finder.IsDirectory())
{
ScanDirectoryByDeep(csTextOut, csFileOrDir, nDeep + 1);
csTextOut.AppendFormat(_T("[%u-D]%s\r\n"), nDeep, csFileOrDir);
}
else //it's a file
{
csFileList.AppendFormat(_T("[%u-F]%s\r\n"), nDeep, csFileOrDir);
}
}
finder.Close();
//将文件名附进来
csTextOut += csFileList;
//根层进入时统计时间
if (0 == nDeep)
{
nTimeSpan = GetCurTimeStamp() - nTimeSpan;
}
return nTimeSpan;
}
//************************************
// Method: 实现广度扫描
// FullName: CScanDirectoryDlg::ScanDirectoryByBreadth
// Access: public static
// Returns: unsigned long 返回历时
// Parameter: CString & csTextOut
// Parameter: LPCTSTR pszRoot
// Parameter: int nDeep 层次 (目录层次输出暂未实现)
//************************************
unsigned long ScanDirectoryByBreadth( CString& csTextOut, LPCTSTR pszRoot, int nDeep )
{
// 搜索该路径下的文件
deque<CString> deDirectory;
CFileFind finder;
BOOL bWorking;
unsigned long nTimeSpan;
nTimeSpan = GetCurTimeStamp(); //time count start
CString csDir(pszRoot);
nDeep = 0;
bWorking = finder.FindFile(csDir + _T("\\*.*"));
while (bWorking)
{
bWorking = finder.FindNextFile();
// skip . and .. files;
if (finder.IsDots())
{
continue;
}
// if it's a directory
CString strSubDir = finder.GetFilePath();
if (finder.IsDirectory())
{
csTextOut.AppendFormat(_T("[%u-D]%s\r\n"), nDeep, strSubDir);//记录下文件目录名
deDirectory.push_back(strSubDir);
}
else //it's a file
{
csTextOut.AppendFormat(_T("[%u-F]%s\r\n"), nDeep, strSubDir); // 记录下文件名
}
}
// 寻找一级目录下的子目录或文件
++nDeep;
while(!deDirectory.empty())
{
std::deque<CString>::iterator it = deDirectory.begin();
CFileFind finder;
BOOL bWorking = finder.FindFile((*it) + _T("\\*.*"));
while(bWorking)
{
bWorking = finder.FindNextFile();
if (finder.IsDots())
{
continue;
}
// if it's a directory
CString csFileOrDir = finder.GetFilePath();
if (finder.IsDirectory())
{
csTextOut.AppendFormat(_T("[%u-D]%s\r\n"), nDeep, csFileOrDir); //记录下文件目录名
deDirectory.push_back(csFileOrDir);
}
else //it's a file
{
csTextOut.AppendFormat(_T("[%u-D]%s\r\n"), nDeep, csFileOrDir); // 记录下文件名
}
}
// 删除队列的头元素
deDirectory.pop_front();
}
nTimeSpan = GetCurTimeStamp() - nTimeSpan; //time count end
return nTimeSpan;
}
相关文章推荐
- C++实现图的邻接矩阵存储和广度、深度优先遍历实例分析
- 图的深度优先和广度优先遍历(图以邻接表表示,由C++面向对象实现)
- 图及其算法复习(Java实现) 一:存储结构,深度优先周游,广度优先周游
- C/C++代码实现图(有向图)的深度,广度优先遍历
- 数据结构之图---深度优先遍历---C++实现
- 有向图深度优先与广度优先算法的C++实现
- BFS_DFS深度广度优先C++实现。
- 数据结构之图---广度优先遍历---C++实现
- C++实现图的广度优先遍历与深度优先遍历
- 图的深度优先(非递归)、广度优先、最小生成树的C++实现
- 存储结构与邻接矩阵,深度优先和广度优先遍历及Java实现
- 简要说明树的深度优先、广度优先遍历算法,及非递归实现的特点
- 图的存储及遍历 深度遍历和广度遍历 C++代码实现
- 【算法学习】图相关算法编程实现-深度优先遍历和广度优先遍历
- 百度面试题——简要说明树的深度优先、广度优先遍历算法,及非递归实现的特点
- 图的邻接表存储 深度优先遍历 广度优先遍历 C语言实现
- c++实现树的广度搜索和深度搜索完整代码
- 《算法导论》中广度优先搜索的实现 c++
- 深度优先、广度优先和A*算法实现的重排九宫问题
- 数据结构-图-as3实现-有向图 图存储(邻接矩阵),广度深度遍历