How would I calculate the distance matrix of a connected, simple and undirected graph from the adjacency matrix? I have 56 nodes, if that is helpful, and would need to the answer to return an array. Thank you!
2026-03-25 04:36:28.1774413388
Calculating the Distance Matrix from Adjacency Matrix
5.8k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in MATRICES
- How to prove the following equality with matrix norm?
- I don't understand this $\left(\left[T\right]^B_C\right)^{-1}=\left[T^{-1}\right]^C_B$
- Powers of a simple matrix and Catalan numbers
- Gradient of Cost Function To Find Matrix Factorization
- Particular commutator matrix is strictly lower triangular, or at least annihilates last base vector
- Inverse of a triangular-by-block $3 \times 3$ matrix
- Form square matrix out of a non square matrix to calculate determinant
- Extending a linear action to monomials of higher degree
- Eiegenspectrum on subtracting a diagonal matrix
- For a $G$ a finite subgroup of $\mathbb{GL}_2(\mathbb{R})$ of rank $3$, show that $f^2 = \textrm{Id}$ for all $f \in G$
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in ALGEBRAIC-GRAPH-THEORY
- Normalized Laplacian eigenvalues of a path graph
- Can i consider ($\emptyset, \infty, \emptyset$) to denote a null graph?
- number of edges in infinite graph
- 2-fold covers of graphs, their spectrum and the matching polynomial
- Is the following fact for laplace matrix true? And how to prove it?
- Automorphisms of cospectral k-regular graphs
- Understanding Generalised Quadrangles
- For any sets $X$ & $Y$ can the group of automorphisms for the digraph $G(X,Y)=(X\cup Y,X\times Y)$ be express in terms of symmetric groups?
- Proof that bipartite graph has perfect matching if and only if zero sub-matrix is not included
- Convergence of function with matrix as input
Related Questions in PYTHON
- Solve an equation with binary rotation and xor
- Function to rotate on a 3D sphere at a fixed distance?
- Verify the Riemann Hypothesis for first 1000 zeros.
- confused by the description of numpy.linalg.lstsq
- Rotate around a specific point instead of 0,0,0
- Calculating $\pi$: using a spigot and starting from middle
- Prove by the Principle of Recursion
- Use recursion to prove the bounds of the Fibonacci numbers when $n\geq 2$
- How to perform a double (numerical) integration of $f(x,y)$ over an irregular sample of $x$ and $y$ values
- What does s(n) = s(n) mean?
Related Questions in ADJACENCY-MATRIX
- Shape of the graph spectrum
- Use the definition of matrix multiplication to explain why the analogous result holds for any entry of Adjacency Matrix $A^2$.
- Do isomorphic graphs have same values for adjacency matrices and spectrum?
- Edge-to-edge incidence structure of a graph
- Is there an approximation to a matrix $V = (I-cA)^{-1}$ where $I$ is the identity matrix and $A$ is an adjacency matrix of a connected graph?
- Is it possible to normalize a symmetric matrix without breaking symmetry?
- Spectral radius of a complete bipartite graph
- What is a suitable index to express similarity in two observations of the same set of variables containing ratios?
- How to find Eulerian path in the given graph?
- Spectral radius of a complete tripartite graph
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I believe you can also take the matrix multiple of the matrix by itself
ntimes. I have read that for an entry [j,v] in matrix A:With that in mind, iterate the matrix multiple A@A and freeze new entries (the shortest path from j to v) into a result matrix as they occur and masking by the result matrix so you only get the newest path for some n. This would result in a matrix where each entry [j,v] is the shortest path from j to v.
In my experience, A@A = A for some large n so the calculation is cyclic which can be a terminating condition, I suspect its the maximum path but cannot guarantee as I've only tested on a subset of possible graphs. I would calculate the maximum path possible in any graph: the number of nodes (a graph which is sequentially connected with one loop) and iterate that many times, which guarantees considering all possible paths in all graphs. I've done this with directed graphs but this should hold for symmetry about the main diagonal.
I hate to quote an unreferenced wikipedia article but this has been working for me in practice. https://en.wikipedia.org/wiki/Adjacency_matrix#Matrix_powers
The implementation is trivial enough I think its worth a try. If you try it please let me know if this fails your implementation.