代码搜索：PATH
找到约 10,000 项符合「PATH」的源代码
代码结果 10,000
www.eeworm.com/read/421634/10723200
cpp l7_10.cpp
//用弗洛伊德算法求所有顶点的最短路径
#include
const int max=32767;
const int n=4; //max表示图中顶点的个数
const int e=8;
struct graph
{int arcs[n+1][n+1]; //图的邻接矩阵
int a[n+1][n+1] ;
www.eeworm.com/read/350637/10725014
c srch_env.c
#include
#include
void main(int argc, char *argv[])
{
char path[128];
_searchenv(argv[1], "LIB", path);
if (path[0])
printf("Pathname: %s\n", path);
www.eeworm.com/read/350637/10725252
c srchpath.c
#include
#include
void main(int argc, char *argv[])
{
char *path;
if (path = searchpath(argv[1]))
printf("Pathname: %s\n", path);
else
printf("File n
www.eeworm.com/read/350637/10725367
c split.c
#include
#include
#include
void main(void)
{
char *path_1 = "C:\\SUBDIR\\FILENAME.EXT";
char *path_2 = "SUBDIR\\FILENAME.EXT";
char *path_3 = "FI
www.eeworm.com/read/350637/10725592
c creattmp.c
#include
#include
#include
void main(void)
{
char path[64] = "C:\\TEMP\\";
int handle;
if ((handle = creattemp(path, 0)) == -1)
printf("Error cr
www.eeworm.com/read/350637/10725964
c showpath.c
#include
#include
void main(void)
{
char *entry;
entry = getenv("PATH");
if (*entry)
printf("PATH=%s\n", entry);
else
printf("PATH is not def
www.eeworm.com/read/350636/10726717
c srch_env.c
#include
#include
void main(int argc, char *argv[])
{
char path[128];
_searchenv(argv[1], "LIB", path);
if (path[0])
printf("Pathname: %s\n", path);
www.eeworm.com/read/350636/10726980
c srchpath.c
#include
#include
void main(int argc, char *argv[])
{
char *path;
if (path = searchpath(argv[1]))
printf("Pathname: %s\n", path);
else
printf("File n
www.eeworm.com/read/350636/10727101
c split.c
#include
#include
#include
void main(void)
{
char *path_1 = "C:\\SUBDIR\\FILENAME.EXT";
char *path_2 = "SUBDIR\\FILENAME.EXT";
char *path_3 = "FI
www.eeworm.com/read/350554/10732399
bat a.bat
path D:\Borland\JBuilder2005\jdk1.4\bin
java -jar LibrarySearchingSystem.jar