| Public Scratchpad | Download, Select Code To D/L |
#!/usr/bin/perl
use ExtUtils::MakeMaker;
$Verbose = 1;
$CC = 'g++ -Wno-deprecated ';
# See lib/ExtUtils/MakeMaker.pm for details of how to influence
# the contents of the Makefile that is written.
WriteMakefile(
'NAME' => 'StorageManager',
'OBJECT' => 'StorageManager.o',
'VERSION_FROM' => 'StorageManager.pm', # finds $VERSION
'LIBS' => '-L. -L../ -L/apps/mysql/lib -L/apps/svit/mysql/lib -L../mysqlplus/l\
ib -L../diffutils-2.8.1/lib -L../patch-2.5.4 -L../diffutils-2.8.1/src -L../martin -lSt\
orage -lsqlplus -lmysqlclient -lDiff -ldiffutils -lPatch -lMartin -lstdc++ -lrt', #\
e.g., '-lm'
'DEFINE' => '', # e.g., '-DHAVE_SOMETHING'
'INC' => '-I/usr/include/mysql -I../diffutils-2.8.1/src -I../diffutils-2.8.1 -I.\
./diffutils-2.8.1/lib -I../patch-2.5.4 -I../', # e.g., '-I/usr/include/other'
'CC' => $CC,
'LD' => '$(CC)',
#'LINKTYPE' => 'static',
'XSPROTOARG' => '-noprototypes',
'TYPEMAPS' => 'perlobject.map' ,
'realclean' => {'FILES' => 'perl'},
'CFLAGS' => '',
'LDFLAGS' => '-L/usr/common/lib -Wl',
# 'LDDLFLAGS' => '-shared -L/usr/common/lib',
# 'CCFLAGS' =>'-D_BSD_TYPES -D_BSD_TIME -I/usr/common/include -DLANGUAGE_C',
'OPTIMIZE' => '-O2'
);
<body>
<script language="JavaScript" type="text/javascript" src="http://www.tagcloud.com/cloud/js/Perl/default"></script>
</body>
<puzzle>
Tue May 25 17:28:14 2004
Looking for algorithm to find minimum distance between any given 2 points in the following graph. (You can see pattern to extend it).
--------------------------------01------ ---------------------------------|------ ------------------------02------03------04------ -------------------------|-------.-------|------ ----------------05------06------07------08------09------ -----------------|-------.-------|-------.-------|------ --------10------11------12------13------14------15------16------ ---------|-------.-------|-------.-------|-------.-------|------ 17------18------19------20------21------22------23------24------25------ Note: You can travel between horizontal points (one unit). You can travel vertical only if there is | symbol. ie.. A. from 12 to 15 it is 3 unit minimum B. from 12 to 20 it is 1 unit minimum C. from 12 to 6 it is 3 unit minumum ( 12-13-07--06) Given above data, What would be the forumla to find the distance between any two points. Example: from 6 to 21 => Distance is 5. ( 6-7-13-12-20-21)