static void Main(string[] args)
{
GRAPH g = new GRAPH();
string input_filename = args[0];
inputValue(input_filename, g);
Console.ReadLine();
}
private static void inputValue(string input_filename, GRAPH g)
{
try
{
using (StreamReader reader = new StreamReader(input_filename))
{
string line = reader.ReadLine();
g.numberOfVertexes = int.Parse(line);
if (g.numberOfVertexes > 2)
{
g.matrix = new int[g.numberOfVertexes, g.numberOfVertexes];
int rowIndex, colIndex;
int sIndex = 0;
line = reader.ReadToEnd().Replace("\r\n", " ");
string[] s = line.Split(' ');
while (sIndex < g.numberOfVertexes * 2)
{
for (rowIndex = 0; rowIndex < g.numberOfVertexes; rowIndex++)
{
for (colIndex = 0; colIndex < g.numberOfVertexes; colIndex++)
{
g.matrix[rowIndex, colIndex] = int.Parse(s[sIndex]);
sIndex++;
}
}
}
reader.Close();
Console.WriteLine(g.numberOfVertexes);
for (rowIndex = 0; rowIndex < g.numberOfVertexes; rowIndex++)
{
for (colIndex = 0; colIndex < g.numberOfVertexes; colIndex++)
{
Console.Write(g.matrix[rowIndex, colIndex] + " ");
}
Console.WriteLine();
}
if (g.matrix[g.numberOfVertexes - 1, 0] == 1)
{
Console.WriteLine("Co");
}
else
{
Console.WriteLine("Khong");
}
Console.WriteLine();
}
else
{
Console.WriteLine("The number of Vertexes must be greater than 2.");
}
}
}
catch (Exception e)
{
Console.WriteLine("The file could not be read: ");
Console.WriteLine(e.Message);
}
}
private static void inputValue(string input_filename, GRAPH g)
{
try
{
using (StreamReader reader = new StreamReader(input_filename))
{
string line = reader.ReadLine();
g.numberOfVertexes = int.Parse(line);
if (g.numberOfVertexes > 2)
{
//Declare variables
g.matrix = new int[g.numberOfVertexes, g.numberOfVertexes];
int rowIndex, colIndex;
int sIndex = 0;
bool directedGraph = false;
int numberOfEdges = 0;
int numberOfVertexesHaveMultiples = 0;
int numberOfLoops = 0;
//Process
line = reader.ReadToEnd().Replace("\r\n", " ");
string[] s = line.Split(' ');
while (sIndex < g.numberOfVertexes * 2)
{
for (rowIndex = 0; rowIndex < g.numberOfVertexes; rowIndex++)
{
for (colIndex = 0; colIndex < g.numberOfVertexes; colIndex++)
{
g.matrix[rowIndex, colIndex] = int.Parse(s[sIndex]);
numberOfEdges += g.matrix[rowIndex, colIndex];
sIndex++;
}
}
}
reader.Close();
Console.WriteLine(g.numberOfVertexes);
//a. Ma tr?n k? c?a d? th?
for (rowIndex = 0; rowIndex < g.numberOfVertexes; rowIndex++)
{
for (colIndex = 0; colIndex < g.numberOfVertexes; colIndex++)
{
Console.Write(g.matrix[rowIndex, colIndex] + " ");
if (g.matrix[rowIndex, colIndex] != g.matrix[colIndex, rowIndex])
{
directedGraph = true;
}
else if ((g.matrix[rowIndex, colIndex] == g.matrix[colIndex, rowIndex]) && directedGraph == true)
{
directedGraph = true;
}
else if ((g.matrix[rowIndex, colIndex] == g.matrix[colIndex, rowIndex]) && directedGraph == false)
{
directedGraph = false;
}
}
Console.WriteLine();
}
if (directedGraph)
{
//b. Xác d?nh tính có hu?ng c?a d? th?
Console.WriteLine("Do thi co huong");
//c. S? d?nh c?a d? th? (k? c? d?nh d?c bi?t)
Console.WriteLine("So dinh cua do thi: " + g.numberOfVertexes);
//d. S? c?nh c?a d? th? (k? c? c?nh d?c bi?t)
Console.WriteLine("So canh cua do thi: " + numberOfEdges);
//e. S? lu?ng c?p d?nh xu?t hi?n c?nh b?i, s? c?nh khuyên
for (rowIndex = 0; rowIndex < g.numberOfVertexes; rowIndex++)
{
for (colIndex = 0; colIndex < g.numberOfVertexes; colIndex++)
{
if (g.matrix[rowIndex, colIndex] != 0 && g.matrix[colIndex, rowIndex] != 0 && colIndex != rowIndex)
{
numberOfVertexesHaveMultiples++;
}
if (g.matrix[rowIndex, colIndex] != 0 && colIndex == rowIndex)
{
numberOfLoops++;
}
}
}
Console.WriteLine("So cap dinh xuat hien canh boi: " + numberOfVertexesHaveMultiples / 2);//Chia 2 vi khi cong se double
Console.WriteLine("So canh khuyen: " + numberOfLoops);
int[] inDegree = new int[g.numberOfVertexes];
int[] outDegree = new int[g.numberOfVertexes];
//xac dinh bac vao theo rowIndex
for (colIndex = 0; colIndex < g.numberOfVertexes; colIndex++)
{
for (rowIndex = 0; rowIndex < g.numberOfVertexes; rowIndex++)
{
inDegree[colIndex] += g.matrix[rowIndex, colIndex];
}
}
//xac dinh bac ra theo colIndex
for (rowIndex = 0; rowIndex < g.numberOfVertexes; rowIndex++)
{
for (colIndex = 0; colIndex < g.numberOfVertexes; colIndex++)
{
outDegree[rowIndex] += g.matrix[rowIndex, colIndex];
}
}
//f. S? d?nh treo, s? d?nh cô l?p
int pendantVertex = 0;
int isolatedVertex = 0;
for (int i = 0; i < g.numberOfVertexes; i++)
{
if (inDegree[i] == 0 && outDegree[i] == 0)
{
isolatedVertex++;
}
else if ((inDegree[i] == 1 && outDegree[i] == 0) || (inDegree[i] == 0 && outDegree[i] == 1))
{
pendantVertex++;
}
}
Console.WriteLine("So dinh treo: " + pendantVertex);
Console.WriteLine("So dinh co lap: " + isolatedVertex);
//g. Xác d?nh b?c vào – b?c ra (n?u là d? th? có hu?ng) c?a t?ng d?nh trong d? th?
Console.WriteLine("(Bac vao - Bac ra) cua tung dinh:");
for (int i = 0; i < g.numberOfVertexes; i++)
{
Console.Write(i + "(" + inDegree[i] + "-" + outDegree[i] + ") ");
}
Console.WriteLine();
//h. Xác d?nh lo?i d? th? co b?n
if (numberOfVertexesHaveMultiples / 2 > 0)
{
Console.WriteLine("Da do thi co huong");
}
else
{
Console.WriteLine("Do thi co huong");
}
}
else if (!directedGraph)
{
Console.WriteLine("Do thi vo huong");
//c. S? d?nh c?a d? th? (k? c? d?nh d?c bi?t)
Console.WriteLine("So dinh cua do thi: " + g.numberOfVertexes);
//d. S? c?nh c?a d? th? (k? c? c?nh d?c bi?t)
//=> Ch? tính tam giác trên c?a hình vuông. S? c?nh th?c t? là t?ng s? c?nh/2.
//Tuy nhiên T?t C? nh?ng giá tr? trên du?ng chéo không du?c chia 2.
//Do dó sau khi ta chia dôi xong r?i ta l?i c?ng vào 1/2 giá tr? c?a du?ng chéo
numberOfEdges = 0;
for (rowIndex = 0; rowIndex < g.numberOfVertexes; rowIndex++)
{
for (colIndex = rowIndex; colIndex < g.numberOfVertexes; colIndex++)
{
numberOfEdges += g.matrix[rowIndex, colIndex];
}
}
Console.WriteLine("So canh cua do thi: " + numberOfEdges);
//e. S? lu?ng c?p d?nh xu?t hi?n c?nh b?i, s? c?nh khuyên
for (rowIndex = 0; rowIndex < g.numberOfVertexes; rowIndex++)
{
for (colIndex = 0; colIndex < g.numberOfVertexes; colIndex++)
{
if (g.matrix[rowIndex, colIndex] > 1)
{
numberOfVertexesHaveMultiples++;
}
if (g.matrix[rowIndex, colIndex] != 0 && colIndex == rowIndex)
{
numberOfLoops++;
}
}
}
Console.WriteLine("So cap dinh xuat hien canh boi: " + numberOfVertexesHaveMultiples / 2);
Console.WriteLine("So canh khuyen: " + numberOfLoops);
int[] degree = new int[g.numberOfVertexes];
for (rowIndex = 0; rowIndex < g.numberOfVertexes; rowIndex++)
{
for (colIndex = 0; colIndex < g.numberOfVertexes; colIndex++)
{
if (rowIndex == colIndex)
{
degree[rowIndex] += g.matrix[rowIndex, colIndex] * 2;
}
else
{
degree[rowIndex] += g.matrix[rowIndex, colIndex];
}
}
}
//f. S? d?nh treo, s? d?nh cô l?p
int pendantVertex = 0;
int isolatedVertex = 0;
for (int i = 0; i < g.numberOfVertexes; i++)
{
if (degree[i] == 0)
{
isolatedVertex++;
}
else if (degree[i] == 1)
{
pendantVertex++;
}
}
Console.WriteLine("So dinh treo: " + pendantVertex);
Console.WriteLine("So dinh co lap: " + isolatedVertex);
//g. Xác d?nh b?c(n?u là d? th? vô hu?ng) c?a t?ng d?nh trong d? th?
Console.WriteLine("Bac cua tung dinh:");
for (int i = 0; i < g.numberOfVertexes; i++)
{
Console.Write(i + "(" + degree[i] + ") ");
}
Console.WriteLine();
//h. Xác d?nh lo?i d? th? co b?n
if (numberOfLoops > 0)
{
Console.WriteLine("Gia do thi");
}
else if (numberOfVertexesHaveMultiples / 2 > 0)
{
Console.WriteLine("Da do thi");
}
else
{
Console.WriteLine("Don do thi");
}
}
}
else
{
Console.WriteLine("The number of Vertexes must be greater than 2.");
}
}
}
catch (Exception e)
{
Console.WriteLine("The file could not be read: ");
Console.WriteLine(e.Message);
}
}
