Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
compiled prog
//Rextester.Program.Main is the entry point for your code. Don't change it. //Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5 using System; using System.Collections.Generic; using System.Linq; using System.Text.RegularExpressions; namespace Rextester { public class Program { public static void Main(string[] args) { using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Diagnostics; namespace FloydWarshallAlgorithm { class FloydWarshallAlgo { public const int cst = 9999; private static void Print(int[,] distance, int verticesCount) { Console.WriteLine("Shortest distances between every pair of vertices:"); for (int i = 0; i < verticesCount; ++i) { for (int j = 0; j < verticesCount; ++j) { if (distance[i, j] == cst) Console.Write("cst".PadLeft(7)); else Console.Write(distance[i, j].ToString().PadLeft(7)); } Console.WriteLine(); } } public static void FloydWarshall(int[,] graph, int verticesCount) { int[,] distance = new int[verticesCount, verticesCount]; for (int i = 0; i < verticesCount; ++i) for (int j = 0; j < verticesCount; ++j) distance[i, j] = graph[i, j]; for (int k = 0; k < verticesCount; ++k) { for (int i = 0; i < verticesCount; ++i) { for (int j = 0; j < verticesCount; ++j) { if (distance[i, k] + distance[k, j] < distance[i, j]) distance[i, j] = distance[i, k] + distance[k, j]; } } } Print(distance, verticesCount); } static void Main(string[] args) { int[,] graph = { { 0, 6, cst, 11 }, { cst, 0, 4, cst }, { cst, cst, 0, 2 }, { cst, cst, cst, 0 } }; FloydWarshall(graph, 4); } } } } } }
run
|
edit
|
history
|
help
0
ICollection<T>.Add(T) - Performance Test
Factorial using Recursion
Intuit // C# // listing_4.6 (if_then_else // Shooting on the target)
Custom Date Format
ReverseArrayC#
valida fechas sura
test code
XmlSerializer
seconds to minutes, hour and seconds
working aes encryption/decryption