CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - col
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
GUI Develop
Windows Kernel
WinSock-NDIS
Driver Develop
ADO-ODBC
GDI-Bitmap
CSharp
.net
Multimedia Develop
Communication
Shell api
ActiveX/DCOM/ATL
IME Develop
ISAPI-IE
Hook api
Screen saver
DirextX
Process-Thread
Console
File Operate
Printing program
Multi Monitor
DNA
Other
Search - col - List
[
CSharp
]
布线问题(分支限界算法应用)
DL : 0
六 程序实现: #include <stdio.h> typedef struct { int row int col }Position int FindPath (Position start, Position finish, int &PathLen, Position *&path) { //计算从起始位置start到目标位置finish的最短布线路径,找到返回1,否则,返回0 int i if ((start.row = = finish.row) && (start.col = = finish.col)) { PathLen = 0 return 0 } //start = finish //设置方格阵列”围墙” for (i = 0 i <= m+1 i++) grid[0][i] = grid[n+1 -6 program : # include
Date
: 2008-10-13
Size
: 11.59kb
User
:
敖斌
[
CSharp
]
布线问题(分支限界算法应用)
DL : 0
六 程序实现: #include <stdio.h> typedef struct { int row int col }Position int FindPath (Position start, Position finish, int &PathLen, Position *&path) { //计算从起始位置start到目标位置finish的最短布线路径,找到返回1,否则,返回0 int i if ((start.row = = finish.row) && (start.col = = finish.col)) { PathLen = 0 return 0 } //start = finish //设置方格阵列”围墙” for (i = 0 i <= m+1 i++) grid[0][i] = grid[n+1 -6 program :# include
Date
: 2025-12-27
Size
: 11kb
User
:
敖斌
[
CSharp
]
inherit-
DL : 0
试定义类TRI(三角形)及其派生类COL(三角柱体).其中三角形类可以计算三角形的面积和周长:三角柱体类可以计算柱体的体积和表面积.-Try to define classes TRI (triangle) and its derived classes COL (triangular prism) which can calculate the triangle class area and perimeter of triangles: triangular prism class can calculate the volume and surface area of the cylinder.
Date
: 2025-12-27
Size
: 1kb
User
:
姜玉洁
[
CSharp
]
YUANDAIMA
DL : 0
用二维数组实现矩阵转置,希望初学者能学到一些东西-#include <stdio.h> #define ROW 3 #define COL 4 main() { int matrixA[ROW][COL],matrixB[COL][ROW] int i,j clrscr() printf( Enter elements of the matrixA, ) printf( d* d:\n ,ROW,COL) for( i=0 i<ROW i++ ) { for( j=0 j<COL j++ ) { scanf( d ,&matrixA[i][j]) } } for( i=0 i<ROW i++ ) { for( j=0 j<COL j++ ) { matrixB[j][i] = matrixA[i][j] } } printf( MatrixB, ) printf( d* d:\n ,COL,ROW) for( i=0 i<COL i++ ) { for( j=0 j<ROW j++ ) { printf( 8d ,matrixB[i][j]) } printf( \n ) } printf( \n Press Any Key to Quit... \n ) getch() }
Date
: 2025-12-27
Size
: 10kb
User
:
gansiyi
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.