## The 11th Blue Bridge Cup provincial Simulation Competition - Changcao

The 11th Blue Bridge Cup provincial Simulation Competition - Changcao Title Description Xiao Ming has an open space, which he divides into n n n line m m The length of each row and c ...

Added by mikeylikesyou on Wed, 09 Mar 2022 17:42:11 +0200

## D * algorithm (Dynamic A Star)

D * algorithm (Dynamic A Star) Symbol and function description Openlist is a tool that can be used to do Breadth first search Queue of The identification tag s of node state are divided into three categories: those that have not joined the open table (new), those in the open table (open), and those that have been in the open table but have b ...

Added by Usagi on Mon, 07 Mar 2022 09:59:31 +0200

## CF540C Ice Cave problem solving Report

CF540C Ice Cave problem solving Report 1 topic link http://codeforces.com/contest/540/problem/C 2 topic arrangement 2.1 Title: ice cave 2.2 Title Description You play computer games. Your character stands on one level of a multi-level ice cave. In order to move on, you need to go down one layer. The only way is to fall off the ice. Your ...

Added by psolus21 on Fri, 04 Mar 2022 20:55:04 +0200

## Detailed explanation of differential constraint system

Differential constraint system What is differential constraint system Difference constraint system refers to a method to solve the following multivariate primary inequality system, in which (y1,y2... yn are constants), which is called difference because each inequality of multivariate primary inequality system is about the difference between ...

Added by sevenupcan on Thu, 03 Mar 2022 17:01:29 +0200

## [layering diagram shortest circuit] [shortest circuit deformation] communication line AcWing340

There are N communication base stations in the suburbs, P two-way cables, and the i cable connects the base stations Ai and Bi. In particular, base station 1 is the main station of the communication company, and base station N is located in a farm. Now, the farmer wants to upgrade the communication line, and upgrading the i Cable Costs Li. T ...

Added by Chief on Tue, 01 Mar 2022 14:26:31 +0200

## Adjacency matrix implementation based on C++

Adjacency matrix (note the directed adjacency matrix graph implemented here) The adjacency matrix of a graph is stored in two arrays. A one-dimensional array stores the vertex information in the graph, and a two-dimensional array (adjacency matrix) stores the edge or arc information in the graph. Let graph G have n vertices, then the adjacency ...

Added by smartknightinc on Thu, 24 Feb 2022 12:17:08 +0200

## STL topology sorting

preface My story with topological sorting The first contact was the class of data structure. However, I was addicted to playing games and didn't understand the code at that time. The second time was the punch in group. The second question of a force deduction fortnightly competition was topological sorting (I used violence to cycle 100 times ...

Added by hi2you on Tue, 22 Feb 2022 07:53:43 +0200

## Tarjan algorithm derives edge two-point double code with LCA shrink point, secant point, strong connection component

For Tribal Members Only Introduction to Tarjan algorithm The Tarjan algorithm is based on a depth-first search algorithm that defines the order number (timestamp) of the nodes where DFN(u) is the node and the order number of the earliest node that a subtree with Low(u) is the u or u can trace back to C++ code, using a chain forward star ma ...

Added by ahzulfi on Mon, 21 Feb 2022 19:11:07 +0200

## [algorithm cultivation] graph theory algorithm II (topological sorting, bipartite graph, and search set)

Learn from https://labuladong.gitee.io/algo/2/19/36/ 1, DFS implements topology sorting Immediately above: why do you need to reverse the result of post order traversal to get the result of topological sorting? Take the above binary tree as a directed graph and point from the root node to the left and right child nodes. Then, the root nod ...

Added by sapoxgn on Mon, 21 Feb 2022 15:21:51 +0200

## The basic introduction of graph and depth first traversal and breadth first traversal

1. Basic introduction of figure 1.1 definition of drawing A graph is a data structure in which a node can have zero or more adjacent elements. The connection between two nodes is called an edge. Nodes can also be called vertices. Undirected graph: the connection between vertices has no direction, such as A-B, that is, a - > b or B - ...

Added by Dan06 on Mon, 21 Feb 2022 08:46:53 +0200