Matrix.cs 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278
  1. using System;
  2. using System.Collections.Generic;
  3. using System.Windows.Controls;
  4. namespace DrawGraph
  5. {
  6. public class Matrix
  7. {
  8. /// <summary>
  9. /// Creates an adjacency matrix from given nodes and edges
  10. /// </summary>
  11. /// <param name="nodes">Array of nodes</param>
  12. /// <param name="edges">Array of edges</param>
  13. /// <returns>Adjacency matrix in 2D int array</returns>
  14. public static int[,] AdjacencyCreate(Node[] nodes, Edge[] edges)
  15. {
  16. int length = nodes.Length;
  17. int[,] matrix = new int[length, length];
  18. for (int i = 0; i < nodes.Length; i++)
  19. {
  20. var Node1 = nodes[i];
  21. for (int j = 0; j < nodes.Length; j++)
  22. {
  23. if (i != j)
  24. {
  25. var Node2 = nodes[j];
  26. for (int k = 0; k < edges.Length; k++)
  27. {
  28. var edge = edges[k];
  29. if (edge.IsFocused)
  30. {
  31. if (Node.Compare(edge.TargetNode, Node1) &&
  32. Node.Compare(edge.SourceNode, Node2))
  33. if (edge.Weight > 0)
  34. matrix[i, j] = (int) edge.Weight;
  35. else
  36. matrix[i, j] = 1;
  37. else if (Node.Compare(edge.SourceNode, Node1) &&
  38. Node.Compare(edge.TargetNode, Node2))
  39. if (edge.Weight > 0)
  40. matrix[i, j] = (int) edge.Weight;
  41. }
  42. else
  43. {
  44. if (Node.Compare(edge.TargetNode, Node1) &&
  45. Node.Compare(edge.SourceNode, Node2))
  46. if (edge.Weight > 0)
  47. {
  48. matrix[i, j] = (int) edge.Weight;
  49. InvertElement(matrix, i, j);
  50. }
  51. else
  52. {
  53. matrix[i, j] = 1;
  54. InvertElement(matrix, i, j);
  55. }
  56. else if (Node.Compare(edge.SourceNode, Node1) &&
  57. Node.Compare(edge.TargetNode, Node2))
  58. if (edge.Weight > 0)
  59. {
  60. matrix[i, j] = (int) edge.Weight;
  61. InvertElement(matrix, i, j);
  62. }
  63. else
  64. {
  65. matrix[i, j] = 1;
  66. InvertElement(matrix, i, j);
  67. }
  68. }
  69. }
  70. }
  71. else
  72. {
  73. matrix[i, j] = 0;
  74. }
  75. }
  76. }
  77. return matrix;
  78. }
  79. /// <summary>
  80. /// Creates an adjacency matrix from given nodes and edges
  81. /// </summary>
  82. /// <param name="nodes">List of nodes</param>
  83. /// <param name="edges">List of edges</param>
  84. /// <returns>Adjacency matrix in 2D int array</returns>
  85. public static int[,] AdjacencyCreate(List<Node> nodes, List<Edge> edges)
  86. {
  87. Node[] node = nodes.ToArray();
  88. Edge[] edge = edges.ToArray();
  89. return AdjacencyCreate(node, edge);
  90. }
  91. private static int[,] InvertElement(int[,] matrix, int indexX, int indexY)
  92. {
  93. matrix[indexY, indexX] = matrix[indexX, indexY];
  94. return matrix;
  95. }
  96. /// <summary>
  97. /// Creates an incidence matrix from given nodes and edges
  98. /// </summary>
  99. /// <param name="nodes">Array of nodes</param>
  100. /// <param name="edges">Array of edges</param>
  101. /// <returns>Incidence matrix in 2D int array</returns>
  102. public static int[,] IncidenceCreate(Node[] nodes, Edge[] edges)
  103. {
  104. var rows = nodes.Length;
  105. var cols = edges.Length;
  106. var matrix = new int[rows, cols];
  107. for (var i = 0; i < rows; i++)
  108. {
  109. var Node = nodes[i];
  110. for (var j = 0; j < cols; j++)
  111. {
  112. var edge = edges[j];
  113. if (Node.Compare(Node, edge.TargetNode) && edge.IsFocused)
  114. matrix[i, j] = -1;
  115. else
  116. {
  117. if (Node.Compare(Node, edge.TargetNode) || Node.Compare(Node, edge.SourceNode))
  118. if (edge.Weight > 0)
  119. matrix[i, j] = (int)edge.Weight;
  120. else
  121. matrix[i, j] = 1;
  122. else
  123. matrix[i, j] = 0;
  124. }
  125. }
  126. }
  127. return matrix;
  128. }
  129. /// <summary>
  130. /// Creates an incidence matrix from given nodes and edges
  131. /// </summary>
  132. /// <param name="nodes">List of nodes</param>
  133. /// <param name="edges">List of edges</param>
  134. /// <returns>Incidence matrix in 2D int array</returns>
  135. public static int[,] IncidenceCreate(List<Node> nodes, List<Edge> edges)
  136. {
  137. Node[] node = nodes.ToArray();
  138. Edge[] edge = edges.ToArray();
  139. return IncidenceCreate(node, edge);
  140. }
  141. /// <summary>
  142. /// Creates nodes and edges from adjacency matrix
  143. /// </summary>
  144. /// <param name="matrix">Adjacency matrix</param>
  145. /// <returns>Tuple of node and edge array</returns>
  146. public static Tuple<Node[], Edge[]> FromAdjacency(int[,] matrix)
  147. {
  148. Random random = new Random();
  149. Node[] nodes = new Node[matrix.GetLength(0)];
  150. Edge[] edges = new Edge[0];
  151. int[,] buffer = new int[edges.Length, edges.Length];
  152. for (int i = 0; i < nodes.Length; i++)
  153. {
  154. nodes[i] = new Node(random.Next(0, Settings.CanvasWidth), random.Next(0, Settings.CanvasHeight));
  155. }
  156. for (int i = 0; i < nodes.Length; i++)
  157. for (int j = 0; j < nodes.Length; j++)
  158. {
  159. if (matrix[i, j] > 0 && matrix[i, j] == matrix[j, i])
  160. {
  161. buffer[j, i] = 1;
  162. buffer[i, j] = 1;
  163. }
  164. else if (matrix[i, j] > 0 && matrix[i, j] != matrix[j, i])
  165. buffer[i, j] = 1;
  166. else
  167. buffer[i, j] = 0;
  168. }
  169. for (int i = 0; i < nodes.Length; i++)
  170. {
  171. var sourceNode = nodes[i];
  172. for (int j = 0; j < nodes.Length; j++)
  173. {
  174. var targetNode = nodes[j];
  175. if (buffer[i, j] != 1)
  176. {
  177. if (matrix[i, j] > 0 && matrix[j, i] == matrix[i, j])
  178. {
  179. Array.Resize(ref edges, edges.Length + 1);
  180. var index = edges.Length - 1;
  181. edges[index] = new Edge(sourceNode, targetNode, false);
  182. }
  183. else if (matrix[i, j] > 0 && matrix[i, j] != matrix[j, i])
  184. {
  185. Array.Resize(ref edges, edges.Length + 1);
  186. var index = edges.Length - 1;
  187. edges[index] = new Edge(sourceNode, targetNode, true);
  188. }
  189. }
  190. }
  191. }
  192. return Tuple.Create(nodes, edges);
  193. }
  194. /// <summary>
  195. /// Creates nodes and edges from adjacency matrix and add all elements to your canvas
  196. /// </summary>
  197. /// <param name="matrix">Adjacency matrix</param>
  198. /// <param name="canvas">Canvas to draw</param>
  199. /// <returns>Tuple of nodes and edges</returns>
  200. public static Tuple<Node[], Edge[]> FromAdjacencyToCanvas(int[,] matrix, Canvas canvas)
  201. {
  202. var items = FromAdjacency(matrix);
  203. Node[] nodes = items.Item1;
  204. Edge[] edges = items.Item2;
  205. GraphAction.AddRangeToCanvas(nodes, edges, canvas);
  206. return Tuple.Create(nodes, edges);
  207. }
  208. /// <summary>
  209. /// Creates nodes and edges from incidence matrix
  210. /// </summary>
  211. /// <param name="matrix">Incidence matrix</param>
  212. /// <returns>Tuple of nodes and edges array</returns>
  213. public static Tuple<Node[], Edge[]> FromIncidence(int[,] matrix)
  214. {
  215. Random random = new Random();
  216. int rows = matrix.GetLength(0);
  217. int cols = matrix.GetLength(1);
  218. Node[] nodes = new Node[rows];
  219. Edge[] edges = new Edge[cols];
  220. int cost = int.MaxValue;
  221. Node buffer = null;
  222. for(int i = 0; i < rows; i++)
  223. {
  224. nodes[i] = new Node(random.Next(0, Settings.CanvasWidth), random.Next(0, Settings.CanvasHeight));
  225. }
  226. for(int i = 0; i < cols; i++)
  227. {
  228. for(int j = 0; j < rows; j++)
  229. {
  230. if (matrix[i, j] > 0)
  231. {
  232. if (buffer == null)
  233. {
  234. cost = matrix[i, j];
  235. buffer = nodes[j];
  236. }
  237. else
  238. {
  239. if (matrix[i, j] == (cost * (-1)))
  240. edges[i] = new Edge(buffer, nodes[j], matrix[i, j], true);
  241. else
  242. edges[i] = new Edge(buffer, nodes[j], matrix[i, j], false);
  243. }
  244. }
  245. }
  246. }
  247. return Tuple.Create(nodes, edges);
  248. }
  249. /// <summary>
  250. /// Creates nodes and edges from incidence matrix and add all elements to your canvas
  251. /// </summary>
  252. /// <param name="matrix">Incidence matrix</param>
  253. /// <param name="canvas">Canvas to draw</param>
  254. /// <returns>Tuple of nodes and edges</returns>
  255. public static Tuple<Node[], Edge[]> FromIncidenceToCanvas(int[,] matrix, Canvas canvas)
  256. {
  257. var tuple = FromIncidence(matrix);
  258. Node[] nodes = tuple.Item1;
  259. Edge[] edges = tuple.Item2;
  260. GraphAction.AddRangeToCanvas(nodes, edges, canvas);
  261. return Tuple.Create(nodes, edges);
  262. }
  263. }
  264. }