Skip to content

Instantly share code, notes, and snippets.

5 vertices in 00:00:00.0037841
0
6 vertices in 00:00:00.0007707
0
7 vertices in 00:00:00.0000710
0
3
8 vertices in 00:00:00.0000870
4
9 vertices in 00:00:00.0000628
3
4
5 vertices in 69471
6 vertices in 46
4
6
7 vertices in 3522
8 vertices in 57
9 vertices in 60
1
5 Time that has passed 12526
6 Time that has passed 201
7 Time that has passed 123
8 Time that has passed 133
9 Time that has passed 204
10 Time that has passed 162
11 Time that has passed 229
12 Time that has passed 186
13 Time that has passed 263
14 Time that has passed 891
public void searchForArtPoints()
{
int initialComponents = this.searhchForConnectivityComponents(-1);
for (int i = 0; i < graph.Count(); i++)
{
for (int k = 0; k < graph.Count(); k++)
{
visitedVerticesConComp[k] = false;
clc
%Бикчентаев Амир _constr graph_func
x = -10 : 0.1 : 0;
x2 = 0 : 0.1 : 10;
%1
y = ((1 + x.^2)./(1 + x.^4)).^0.5;
y2 = 2*x2 + sin(x2).^2/ 3 + x2;
plot(x, y,'c-.',x2, y2,'m--+');
grid on
function varargout = Bikchentaev(varargin)
gui_Singleton = 1;
gui_State = struct('gui_Name', mfilename, ...
'gui_Singleton', gui_Singleton, ...
'gui_OpeningFcn', @abubakirov_2_OpeningFcn, ...
'gui_OutputFcn', @abubakirov_2_OutputFcn, ...
'gui_LayoutFcn', [] , ...
'gui_Callback', []);
if nargin && ischar(varargin{1})
gui_State.gui_Callback = str2func(varargin{1});
5 vertices in 78848
6 vertices in 8400
7 vertices in 144
8 vertices in 136
9 vertices in 166
10 vertices in 196
11 vertices in 200
12 vertices in 244
13 vertices in 280
14 vertices in 256
6 vertices in 177
7 vertices in 123
8 vertices in 186
9 vertices in 261
10 vertices in 291
11 vertices in 294
12 vertices in 279
13 vertices in 192
14 vertices in 444
15 vertices in 231
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Diagnostics;
namespace Nurmeev
{
class Graph
{
public void searchForArtPoints()
{
int initialComponents = this.searhchForConnectivityComponents(-1);
for (int i = 0; i < graph.Count(); i++)
{
for (int k = 0; k < graph.Count(); k++)
{
visitedVerticesConComp[k] = false;