volfmath123

mathlab2!$

Mar 30th, 2016
115
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.72 KB | None | 0 0
  1. I
  2. n=7
  3. a=MakeGraph[Range[n],(Mod[#1,#2]==1)&]
  4. ShowGraph[a]
  5. n=10
  6. b=MakeGraph[Range[n],(Mod[#1,#2]<3)&]
  7. ShowGraph[b]
  8. n=12
  9. c=MakeGraph[Range[n],(Floor[#1/#2]>5||Floor[#1/#2]<3)&]
  10. ShowGraph[c]
  11. n=20
  12. d=MakeGraph[Range[n],(#1^2+#1>#2^3-#2)&]
  13. ShowGraph[d]
  14. n=15
  15. e=MakeGraph[Range[2,n+1],(#1-IntegerPart[Sqrt[#1]]>=Mod[#2,(#2-
  16. 1)])&]
  17. ShowGraph[e]
  18.  
  19. II
  20. n = Input["Vnesi N"]
  21. m = Input["Vnesi M"]
  22. i = Input["Vnesi I"]
  23. j = Input["Vnesi J"]
  24. completegraph = CompleteGraph[n]
  25. ShowGraph[SetGraphOptions[AddVertex[completegraph, {i, j}],
  26. {{1, 2, VertexColor->Blue, VertexStyle->Disk[Large]},
  27. {n, VertexColor-> Red}}, EdgeColor->Green]
  28. ]
  29. stargraph=Star[m]
  30. ShowGraph[DeleteEdge[stargraph, {i, j}]]
  31.  
  32. III
  33. n = Input["Vnesi N"]
  34. m = Input["Vnesi M"]
  35. t = Input["Vnesi T"]
  36. loopgraph1 = MakeGraph[Range[n], (#1==#2)&]
  37. loopgraph2 = MakeGraph[Range[m], (#1==#2)&]
  38. For[i=1, i<n, i++,
  39. loopgraph1 = AddEdge[loopgraph1, {i, i+1}];
  40. loopgraph2 = DeleteVertex[loopgraph2, i];
  41. ]
  42. For[i=0, i<m, i++,
  43. loopgraph1 = AddVertex[loopgraph1];
  44. loopgraph2 = DeleteEdge[loopgraph2, {i, i}];
  45. ]
  46. ShowGraph[loopgraph1]
  47. ShowGraph[loopgraph2]
  48. uniongraph=GraphUnion[loopgraph1, loopgraph2]
  49. ShowGraph[uniongraph]
  50. ShowGraph[InduceSubgraph[uniongraph, RandomSubset[Range[t]]]]
  51.  
  52. IV
  53. While[1==1,
  54. opcija=Input["Izberi Opcija"];
  55. If[opcija==0, Break[]];
  56. If[opcija==1,
  57. n=Input["vnesi n"];
  58. graph=CompleteGraph[n];
  59. ];
  60. If[opcija==2,
  61. n=Input["vnesi n"];
  62. graph=Star[n];
  63. ];
  64. If[opcija==3,
  65. graph=AddVertex[graph]
  66. ];
  67. If[opcija==4,
  68. index = Input["Vnesi indeks"];
  69. graph=DeleteVertex[graph, index]
  70. ];
  71. If[opcija==5,
  72. teme1 = Input["Vnesi prvo teme"];
  73. teme2 = Input["Vnesi vtoro teme"];
  74. graph=AddEdge[opcija, {teme1, teme2}]
  75. ];
  76. If[opcija==6,
  77. teme1 = Input["Vnesi prvo teme"];
  78. teme2 = Input["Vnesi vtoro teme"];
  79. graph=DeleteEdge[graph, {teme1, teme2}]
  80. ]
  81. ]
  82. ShowGraph[graph]
  83.  
  84. V
  85. graf1=MakeGraph[Range[5],(#1==#2 || #1<#2)&];
  86. graf2=MakeGraph[Range[5],(#1==#2 || #1>#2)&];
  87. Isomorphism[graf1,graf2,All]
  88. graf3=CompleteGraph[5]
  89. graf4=CompleteGraph[5]
  90. Isomorphism[graf3,graf4,All]
  91.  
  92. VI
  93. n=Input["Vnesi vrednost za n:"]
  94. graf=CompleteGraph[n]
  95. table=TableForm[ToAdjacencyMatrix[graf]]
  96. Vertices[graf]
  97. brojac=0;
  98. suma=0;
  99. For[i=1,i<=n,i++,
  100. brojac=0;
  101. For[j=1, j<=n, j++,
  102. If[table[[1, i, j]]==1 || table[[1,j,i]]==1,brojac++];
  103. ];
  104. suma+=brojac;
  105. ]
  106. Print[suma]
  107. rebra=suma/2
  108. Print[rebra]
  109.  
  110. VII
  111. n=5
  112. (*graph=MakeGraph[Range[4], (True)&]*)
  113. graph=OrientGraph[RandomGraph[n, 0.85]]
  114. ShowGraph[graph]
  115. tabela=TableForm[ToAdjacencyMatrix[graph]]
  116. izleg=0
  117. vleg=0
  118. For[i=1, i<=n, i++,
  119. For[j=1, j<=n, j++,
  120. If[tabela[[1,i,j]]==1, izleg++];
  121. If[tabela[[1,j,i]]==1, vleg++];
  122. ]
  123. ]
  124. rebra=izleg
  125. Print[rebra]
  126.  
  127. https://www.dropbox.com/s/62use34mzrln49r/dm2-16%20lab2.nb?dl=0
Advertisement
Add Comment
Please, Sign In to add comment