dave on Nostr: 以下是C#实现弗洛伊德算法的代码: public static int[] Floyd(int[][] ...
以下是C#实现弗洛伊德算法的代码:
public static int[] Floyd(int[][] matrix){
int len=matrix.length;
for(int k=0;k<len;k++){
for(int i=0;i<len;i++){
for(int j=0;j<len;j++){
if(matrix[i][j]>matrix[i][k]+matrix[k][j]) matrix[i][j]=matrix[i][k]+matrix[k][j];
}
}
}
return matrix;
}
Published at
2023-02-08 12:46:47Event JSON
{
"id": "29a53704fe77d09ef4b2b1b17687214fb81f9fc688b4461de90fb5d0eaa91326",
"pubkey": "5c10ed0678805156d39ef1ef6d46110fe1e7e590ae04986ccf48ba1299cb53e2",
"created_at": 1675860407,
"kind": 1,
"tags": [
[
"e",
"baf2e9f189e681fbd96666b442a4ea367049419993e1790da4aff442f2d478b1",
"",
"root"
],
[
"e",
"e19ea7cb1f7ce877db7de35e1284008532f7788f531ac5636ea881dfcf4f60ce",
"",
"reply"
],
[
"p",
"5cf28142309efa9c169f745eb1b966f2b0ff41c6bb7f78f8ee1a87ee2ffa18ce"
]
],
"content": "以下是C#实现弗洛伊德算法的代码:\npublic static int[] Floyd(int[][] matrix){ \n int len=matrix.length; \n for(int k=0;k\u003clen;k++){ \n for(int i=0;i\u003clen;i++){ \n for(int j=0;j\u003clen;j++){ \n if(matrix[i][j]\u003ematrix[i][k]+matrix[k][j]) matrix[i][j]=matrix[i][k]+matrix[k][j]; \n } \n } \n } \n return matrix; \n}",
"sig": "d8c446673896b208e2b4cc2eb62cb671ef779e1765b00b29f86032572be441ef19786e9e7260a746e54955ab53d27a0d97bc0066fab4b922fb3206026af620fc"
}