adjacency-matrix

问题 This question already has answers here : How to calculate adjacency matrices in R (2 answers) Closed 6 years ago . An example of the input I am working on is given below: User ID 1 --- Artist 5 User ID 2 --- Artist 1 User ID 3 --- Artist 7 User ID 4 --- Artist 2 User ID 5 --- Artist 3 User ID 1 --- Artist 2 User ID 3 --- Artist 1 The above data is a record of music listened to by users of an app. I would like to generate an adjacency matrix corresponding to the below given example: ARTIST 1

问题 I want to find the adjacency matrix from a csv file that includes the information as follows: A B 1 2 1 3 1 4 2 5 3 7 and so on. There are 100 nodes but everytime I try to create a matrix and subsequently plot the graph, the error is that it is a non-square matrix. Can somebody help me with the correct code in R? 回答1: What you have is an edge list. You can build a graph from that and then covert it to an adjacency matrix: library(igraph) dat <- read.table(text="A B 1 2 1 3 1 4 2 5 3 7",

问题 I want to find the adjacency matrix from a csv file that includes the information as follows: A B 1 2 1 3 1 4 2 5 3 7 and so on. There are 100 nodes but everytime I try to create a matrix and subsequently plot the graph, the error is that it is a non-square matrix. Can somebody help me with the correct code in R? 回答1: What you have is an edge list. You can build a graph from that and then covert it to an adjacency matrix: library(igraph) dat <- read.table(text="A B 1 2 1 3 1 4 2 5 3 7",

问题 I'm a rookie in R and currently working with collaboration data in the form of an edge list with 32 columns and around 200.000 rows. I want to create a (co-)occurrence matrix based on the interaction between countries. However, I want to count the number of interactions by the total number of an object. Basic Example of Aspired Outcome If in one row "England" occurs three times and "China" only one time, the result should be the following matrix. England China England 3 3 China 3 1

问题 Let A be the NxN adjacency matrix of an undirected unweighted network, without self-loops. Let 1 be a column vector of N elements, all equal to 1. In other words 1 = (1, 1, ..., 1)T , where the superscript T indicates the transpose operation. Use the matrix formalism (multiplicative constants, multiplication row by column, matrix operations like transpose and trace, etc, but avoid the sum symbol Σ) to write expressions for: a)The vector k whose elements are the degrees ki of all nodes i = 1,

问题 I have a list like that: > print(list) [[1]] [1] 1 [[2]] [1] 4 [[3]] [1] 1 [[4]] [1] 2 [[5]] [1] 2 [[6]] [1] 3 [[7]] [1] 2 [[8]] [1] 5 [[9]] [1] 1 [[10]] [1] 2 [[11]] [1] 3 [[12]] [1] 7 [[13]] [1] 3 [[14]] [1] 4 [[15]] [1] 3 [[16]] [1] 5 [[17]] [1] 1 [[18]] [1] 1 [[19]] [1] 4 [[20]] [1] 6 Now I want to turn this list into an adjacency matrix so that I can then build a graph undirect not simple (there may be multilinks and selfloops). This list should be read in pairs, that is, (1 4) indicates

问题 I want to convert the adjacency matrix output from ARACNE into a csv file using python (or possibly R). The adj file is set up to show one gene one the right and each of its interactions with other genes. For example: A B 0.4 C 0.3 B C 0.1 E 0.4 C D 0.2 E 0.3 So above, A and B interact with each other and the value of that interaction is 0.4. A and C interact with each other and the value is 0.3 and so on. I want to change the layout so I get... A B 0.4 A C 0.3 B C 0.1 B E 0.4 C D 0.2 C E 0.3

问题 I want to convert the adjacency matrix output from ARACNE into a csv file using python (or possibly R). The adj file is set up to show one gene one the right and each of its interactions with other genes. For example: A B 0.4 C 0.3 B C 0.1 E 0.4 C D 0.2 E 0.3 So above, A and B interact with each other and the value of that interaction is 0.4. A and C interact with each other and the value is 0.3 and so on. I want to change the layout so I get... A B 0.4 A C 0.3 B C 0.1 B E 0.4 C D 0.2 C E 0.3

问题 I can't seem to find any examples (or much information at all) of what a matrix array looks like for a Johnson graph. Can anyone send me an example of what their arrays look like? 回答1: This directly uses the definition of a Johnson Graph given here Wiki Johnson Graph johnsonmatrix[n_, k_] := Module[{s=Select[Subsets[Range[n]], Length[#]==k&]}, {s, MatrixForm[Table[If[Length[Intersection[s[[i]], s[[j]]]]==k-1, 1, 0], {i, Length[s]}, {j, Length[s]}]]}] and generates the list of subsets which

问题 I am working on a minimum spanning tree using Prim's Algorithm with PriorityQueue in Java. However, I am getting the totalWeight (the minimum weight of the tree) wrong. Did I misunderstand the concept behind total weight, or is there some problem with my code? public int getMinSpanningTree(Graph g) { int[][] matrix = g.getEdgeMatrix(); int totalVertices = g.getNumberOfVertices(); boolean[] visit = new boolean[totalVertices]; int visitNum = 1; int totalWeight = 0; PriorityQueue<PriorityVertex>