Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- I
- n=7
- a=MakeGraph[Range[n],(Mod[#1,#2]==1)&]
- ShowGraph[a]
- n=10
- b=MakeGraph[Range[n],(Mod[#1,#2]<3)&]
- ShowGraph[b]
- n=12
- c=MakeGraph[Range[n],(Floor[#1/#2]>5||Floor[#1/#2]<3)&]
- ShowGraph[c]
- n=20
- d=MakeGraph[Range[n],(#1^2+#1>#2^3-#2)&]
- ShowGraph[d]
- n=15
- e=MakeGraph[Range[2,n+1],(#1-IntegerPart[Sqrt[#1]]>=Mod[#2,(#2-
- 1)])&]
- ShowGraph[e]
- II
- n = Input["Vnesi N"]
- m = Input["Vnesi M"]
- i = Input["Vnesi I"]
- j = Input["Vnesi J"]
- completegraph = CompleteGraph[n]
- ShowGraph[SetGraphOptions[AddVertex[completegraph, {i, j}],
- {{1, 2, VertexColor->Blue, VertexStyle->Disk[Large]},
- {n, VertexColor-> Red}}, EdgeColor->Green]
- ]
- stargraph=Star[m]
- ShowGraph[DeleteEdge[stargraph, {i, j}]]
- III
- n = Input["Vnesi N"]
- m = Input["Vnesi M"]
- t = Input["Vnesi T"]
- loopgraph1 = MakeGraph[Range[n], (#1==#2)&]
- loopgraph2 = MakeGraph[Range[m], (#1==#2)&]
- For[i=1, i<n, i++,
- loopgraph1 = AddEdge[loopgraph1, {i, i+1}];
- loopgraph2 = DeleteVertex[loopgraph2, i];
- ]
- For[i=0, i<m, i++,
- loopgraph1 = AddVertex[loopgraph1];
- loopgraph2 = DeleteEdge[loopgraph2, {i, i}];
- ]
- ShowGraph[loopgraph1]
- ShowGraph[loopgraph2]
- uniongraph=GraphUnion[loopgraph1, loopgraph2]
- ShowGraph[uniongraph]
- ShowGraph[InduceSubgraph[uniongraph, RandomSubset[Range[t]]]]
- IV
- While[1==1,
- opcija=Input["Izberi Opcija"];
- If[opcija==0, Break[]];
- If[opcija==1,
- n=Input["vnesi n"];
- graph=CompleteGraph[n];
- ];
- If[opcija==2,
- n=Input["vnesi n"];
- graph=Star[n];
- ];
- If[opcija==3,
- graph=AddVertex[graph]
- ];
- If[opcija==4,
- index = Input["Vnesi indeks"];
- graph=DeleteVertex[graph, index]
- ];
- If[opcija==5,
- teme1 = Input["Vnesi prvo teme"];
- teme2 = Input["Vnesi vtoro teme"];
- graph=AddEdge[opcija, {teme1, teme2}]
- ];
- If[opcija==6,
- teme1 = Input["Vnesi prvo teme"];
- teme2 = Input["Vnesi vtoro teme"];
- graph=DeleteEdge[graph, {teme1, teme2}]
- ]
- ]
- ShowGraph[graph]
- V
- graf1=MakeGraph[Range[5],(#1==#2 || #1<#2)&];
- graf2=MakeGraph[Range[5],(#1==#2 || #1>#2)&];
- Isomorphism[graf1,graf2,All]
- graf3=CompleteGraph[5]
- graf4=CompleteGraph[5]
- Isomorphism[graf3,graf4,All]
- VI
- n=Input["Vnesi vrednost za n:"]
- graf=CompleteGraph[n]
- table=TableForm[ToAdjacencyMatrix[graf]]
- Vertices[graf]
- brojac=0;
- suma=0;
- For[i=1,i<=n,i++,
- brojac=0;
- For[j=1, j<=n, j++,
- If[table[[1, i, j]]==1 || table[[1,j,i]]==1,brojac++];
- ];
- suma+=brojac;
- ]
- Print[suma]
- rebra=suma/2
- Print[rebra]
- VII
- n=5
- (*graph=MakeGraph[Range[4], (True)&]*)
- graph=OrientGraph[RandomGraph[n, 0.85]]
- ShowGraph[graph]
- tabela=TableForm[ToAdjacencyMatrix[graph]]
- izleg=0
- vleg=0
- For[i=1, i<=n, i++,
- For[j=1, j<=n, j++,
- If[tabela[[1,i,j]]==1, izleg++];
- If[tabela[[1,j,i]]==1, vleg++];
- ]
- ]
- rebra=izleg
- Print[rebra]
- https://www.dropbox.com/s/62use34mzrln49r/dm2-16%20lab2.nb?dl=0
Advertisement
Add Comment
Please, Sign In to add comment