Search - n2-1 - CodeBus

Search - n2-1 - List

[Other] sgj4 DL : 0: 邻接矩阵类的根是A d j a c e n c y W D i g r a p h，因此从这个类开始。程序1 2 - 1给出了类的描述。程序中，先用程序1 - 1 3中函数Make2DArray 为二组数组a 分配空间，然后对数组a 初始化，以描述一个n 顶点、没有边的图的邻接矩阵，其复杂性为( n2 )。该代码没有捕获可能由M a k e 2 D A r r a y 引发的异常。在析构函数中调用了程序1 - 1 4中的二维数组释放函数D e l e t e 2 D -adjacency matrix type is the root A d j a c c e n y W D i g r a p h, the category from the start. Procedure 1 2- 1 is a kind of description. Procedures, use procedures 1- 1 3 Make2DArray Function of two arrays a group of space allocation, Then a pair of array initialization to describe a n vertices, there is no edge of the adjacency matrix, the complexity of (n2). The code may not caught by M a k e r 2 D. A. r y a trigger abnormal. The destructor method is called in the process 1- 1 4 2-D array of release function D e l e t e 2 D
Date : 2026-01-08 Size : 1kb User : 史桂金
[Other] sadsafdasgfadg DL : 0: n2-1谜问题, n2-1谜问题 ,-n2-1 mystery problem, n2-1 mystery problem, n2-1 n2-1 mystery mystery problem issues
Date : 2026-01-08 Size : 1kb User : shi
[Other] 23123123keil1 DL : 0: 第 1 章简介概述并描述了Keil Software 为8051系列MCU提供的不同产品第 2 章安装描述了该如何安装软件以及如何设置工具的操作环境 -Chapter 1 Introduction and Overview describes the Keil Software 8051 Series MCU offers different products Chapter 2 describes how to install and how to set the tool to install the software operating environment Chapter 3 describes the main features of development tools, integrated debugger, C compiler, assembler, the uVisi o n2 ID E and
Date : 2026-01-08 Size : 366kb User : 魏莆翀
[Other] 2012 DL : 0: 2012-7月日语N2试题，包含听力mp3和原文，以及试题答案-2012-7 Japanese N2 test, including listening MP3 and text, and answer questions
Date : 2026-01-08 Size : 4.81mb User : 若风
[Other] 0023 DL : 0: 报道了在掺钛蓝宝石环形激光器中加入非线性折射率 n2较大的 SF-57玻璃形成腔内可控的 SPM效应 ,并引入适当的负 GVD,将脉冲宽度从 30 fs压缩至 16 fs,相应的脉冲压缩率为 47-Join the nonlinear refractive index n2 reported greater SF-57 titanium sapphire glass ring laser cavity formed in a controlled The SPM effect, and the introduction of a suitable and negative GVD, the pulse width 30 fs compressed to 16 fs, corresponding pulse compression rate of 47
Date : 2026-01-08 Size : 119kb User : fanzhe
[Other] algorithms DL : 0: Our contribution here is to design efficient distributed algorithms for the maximum flow problem. The idea behind our distributed version of highest-label preflow-push algorithm is to disseminate label values together with safety information every node. When the algorithm terminates, the computed flow is stored distributedly in incident nodes for all edges, that is, each node knows the values of flow which belong to its adjacent edges. We compute maximum flow in O(n 2 log 3 n) time with communication complexity O(n2(log 3 n + V~)), where n and m are the number of nodes and edges respectively in a network graph.-Our contribution here is to design efficient distributed algorithms for the maximum flow problem. The idea behind our distributed version of highest-label preflow-push algorithm is to disseminate label values together with safety information every node. When the algorithm terminates, the computed flow is stored distributedly in incident nodes for all edges, that is, each node knows the values of flow which belong to its adjacent edges. We compute maximum flow in O(n 2 log 3 n) time with communication complexity O(n2(log 3 n+ V~)), where n and m are the number of nodes and edges respectively in a network graph.
Date : 2026-01-08 Size : 393kb User : yangs