Tag：adjacency matrix

GCN, iclr17, graph convolution neural network
Semisupervised classification with graph convolutional networks 1. Motivation Use deep learning on graph structure data, extend CNN technology, and capture the characteristics of nodes on the graph and the proximity of the graph (like CNN, capture local similarity). 2. Multilayer Graph Convolutional Network (GCN) Multilayer graph convolution neural network, the output of each layer is: […]

[gplt] graph coloring problem (c++)
The title is as follows: This question is a wonderful one. It is somewhat of low quality. It is not difficult. The knowledge point is the adjacency matrix, but there are the following wonderful points 1. the color number is 1V, not 1k, which has stuck me for a while; 2. the […]

Storage of Graphs
adjacency matrix Adjacency matrix of undirected graph 1. It must be a symmetric matrix2. The number of nonzero elements in each row (column) is exactly the degree of the vertex Adjacency matrix of directed graph 1. The number of nonzero elements in each row corresponds to the degree2. The number of nonzero elements in each […]

Visual explanation of graph convolution and message passing theory
This paper will study how to construct graph convolution neural network based on message passing mechanism, and create a model to classify molecules with embedded visualization. Suppose we now need to design drugs to treat some diseases. There is a data set containing drugs that successfully treat the disease and drugs that do not work. […]

Simple diagram neural network Chapter 1 overview of diagram reading notes
Write before:Before, in order to cope with the course, project’s learning of GNN was to become a monk halfway, all relying on online blogs. So now I’m not very clear about some of the most basic things at the bottom of GNN. I think I should learn a little. I’ve heard about the book “neural […]

Prim algorithm (minimum spanning tree) is one of the ten common algorithms I know
Preface requirements Today we are learning the prim algorithm. Let’s introduce it from a scene There are 7 villages (a, B, C, D, e, F, g). Now roads need to be built to connect the 7 villages 1. Distance between villagesExpress (weight) with a sidelineFor example, a – B is 5km away 2. AskHow to […]

Storage structure of [PHP data structure] diagram
The concept of figure is almost introduced. You can digest it and continue to learn the following content. If there is no problem, we will continue to learn the next content. Of course, this is not the most troublesome place, because today we just introduce the storage structure of graphs. Sequential storage structure of graphs: […]

Traversal of [PHP data structure] graph: depth first and breadth first
In the last article, we learned the related storage structures of graphs, that is, adjacency matrix and adjacency table. They represent the most typical sequential storage and chain storage. Now that we have data structures, we will learn how to operate these data structures, that is, the algorithm. Whether it’s a graph or a tree, […]

Dijkstra algorithm (implementation of adjacency matrix + adjacency table)
chart input 6 8 0 0 1 1 0 3 4 0 4 4 1 3 2 2 5 1 3 2 2 3 4 3 4 5 3 output 0 1 5 3 4 6 Adjacency matrix implementation #pragma warning (disable:4996) #include <cstdio> #include <vector> #include <algorithm> using namespace std; const int maxn = […]

Pat 1003 emergency (25 points)
Pat 1003 emergency (25 points) As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams in each city and the length of each road between any pair of cities are marked on the […]

[graph theory (including deep search and wide search)] red and black, shortest path
Red and Black There is a rectangular room, covered with square tiles. Each tile is colored either red or black. A man is standing on a black tile. From a tile, he can move to one of four adjacent tiles. But he can’t move on red tiles, he can move only on black tiles. Write […]

Code implementation of graph (adjacency matrix)
I don’t know how readers thought in the last issue. This issue of the article is followed by the last issue. The main content of this paper is: the C + + code implementation of graph (adjacency matrix method), mainly the specific implementation of each class Abstract base class of graph 1 // […]