public void ShowMST()
{
Console.WriteLine("Lista siąsiedztwa:");
for (int i = 0; i < n; i++)
{
Console.Write("A[" + i + "] =");
p = Result.UndirectedGraph[i];
while (p != null)
{
Console.Write("{0,5}:{1}", p.v, p.weight);
p = p.next;
}
Console.WriteLine();
}
Console.WriteLine("Waga MST:" + Result.weight);
}
public void ShowList()
{
Console.WriteLine("Lista siąsiedztwa:");
for (int i = 0; i < n; i++)
{
Console.Write("A[" + i + "] =");
p = DirectedGraph[i]; //skierowany
while (p != null)
{
Console.Write("{0,5}:{1}", p.v, p.weight);
p = p.next;
}
Console.WriteLine();
}
Console.WriteLine("Waga Grafu:" + weight);
}
public void Dijkstra()
{
int i, j, u;
d = new long[n];
p1 = new int[n];
S = new int[n];
bool[] QS = new bool[n];
success = true;
for (i = 0; i < n; i++)
{
d[i] = MAXINT;
p1[i] = -1;
QS[i] = false;
}
d[vNS] = 0; //koszt dojscia do v jest zerowy
for (i = 0; i < n; i++)
{
for (j = 0; QS[j]; j++)
{
;
}
for (u = j++; j < n; j++)
{
if (!QS[j] && (d[j] < d[u]))
{
u = j;
}
}
//znaleziony wierzcholek przenosimy do S
QS[u] = true;
//modyfikujemy odpowiednio wszystich sasiadow u, ktorzy sa w Q
for (p = DirectedGraph[u]; p != null; p = p.next)
{
if (!QS[p.v] && (d[p.v] > d[u] + p.weight))
{
d[p.v] = d[u] + p.weight;
p1[p.v] = u;
}
}
}
}
public void Kruskal()
{
int i;
Queue Q = new Queue(this.m);
DSStruct Z = new DSStruct(this.n);
Result = new AdjacencyList(n);
for (i = 0; i < n; i++)
{
Z.MakeSet(i); //tworz eosobny zbior dla kazdego wierzcholka
}
//umieszczam w kolejce kolejne krawedzie grafu
/*for (i = 0; i < m; i++)
* {
* Q.Push(edges[i]);
* }*/
for (i = 0; i < n; i++)
{
for (p = getAList(i); p != null; p = p.next)
{
e.v1 = i;
e.v2 = p.v;
e.weight = p.weight;
Q.Push(e);
}
}
for (i = 1; i < n; i++)
{
do
{
e = Q.front();
Q.Pop();
} while ((Z.FindSet(e.v1) == Z.FindSet(e.v2)));
Result.addEdge(e);
Z.UnionSets(e);
}
}
public void Prim()
{
int i, v;
Queue Q = new Queue(this.m);
Result = new AdjacencyList(n);
bool[] visited = new bool[n];
for (i = 0; i < n; i++)
{
visited[i] = false;
}
v = 0; //wierzcholek startowy
visited[v] = true; //odwiedzony wierzcholek startowy
for (i = 1; i < n; i++)
{
for (p = getAListU(v); p != null; p = p.next)
{
if (!visited[p.v])
{
e.v1 = v;
e.v2 = p.v;
e.weight = p.weight;
Q.Push(e);
}
}
do
{
e = Q.front();
Q.Pop();
} while (visited[e.v2]);
Result.addEdge(e);
visited[e.v2] = true;
v = e.v2;
}
}
private bool BellmanFord(int v, int[] p1, long[] d)
{
int i, x;
bool test;
d[v] = 0;
for (i = 1; i < n; i++)
{
test = true;
for (x = 0; x < n; x++)
{
for (p = DirectedGraph[x]; p != null; p = p.next)
{
if (d[p.v] > d[x] + p.weight)
{
test = false;
d[p.v] = d[x] + p.weight;
p1[p.v] = x;
}
if (test)
{
return(true);
}
}
}
}
for (x = 0; x < n; x++)
{
for (p = DirectedGraph[x]; p != null; p = p.next)
{
if (d[p.v] > d[x] + p.weight)
{
return(false);
}
}
}
return(true);
}
void addEdge(Edge e)
{
//dodanie krawędzi do grafu nieskierowanego
weight += e.weight;
p = new ALElement();
p.v = e.v2;
p.weight = e.weight;
p.next = UndirectedGraph[e.v1];
UndirectedGraph[e.v1] = p;
p = new ALElement(); // krawędź odwrotna (aby graf był nieskierowany)
p.v = e.v1;
p.weight = e.weight;
p.next = UndirectedGraph[e.v2];
UndirectedGraph[e.v2] = p;
//dodanie krawędzi do grafu skierowanego
p = new ALElement();
p.v = e.v2;
p.weight = e.weight;
p.next = DirectedGraph[e.v1];
DirectedGraph[e.v1] = p;
}
public void GenerateRandomGraph(int v, int g)
{
Random random = new Random();
int i, w, k, v1;
this.n = v;
this.m = v + (v * g / 100);
UndirectedGraph = new ALElement[v];
DirectedGraph = new ALElement[v];
for (i = 0; i < v; i++)
{
UndirectedGraph[i] = null;
DirectedGraph[i] = null;
}
p = new ALElement();
p.v = 4;
p.next = UndirectedGraph[0];
p.weight = random.Next(1, 10);
UndirectedGraph[0] = p;
w = p.weight;
for (i = 0; i < v - 1; i++)
{
e.v1 = i;
e.v2 = i + 1;
e.weight = random.Next(1, 10);
addEdge(e);
}
p = new ALElement();
p.v = 0;
p.next = UndirectedGraph[v - 1];
p.weight = w;// random.Next(1,10);
UndirectedGraph[v - 1] = p;
p = new ALElement();
p.v = 0;
p.next = DirectedGraph[v - 1];
p.weight = w;// random.Next(1,10);
DirectedGraph[v - 1] = p;
weight += w;
for (i = v; i < m; i++)
{
k = random.Next(0, v - 1);
w = random.Next(1, 10);
v1 = random.Next(0, v - 1);
p = new ALElement();
p.weight = w;
p.next = UndirectedGraph[k];
p.v = v1;
UndirectedGraph[k] = p;
p = new ALElement();
p.weight = w;
p.next = DirectedGraph[k];
p.v = v1;
DirectedGraph[k] = p;
p = new ALElement();
p.weight = w;
p.next = UndirectedGraph[v1];
p.v = k;
UndirectedGraph[v1] = p;
weight += w;
}
}
