Borrar filtros
Borrar filtros

Name for adjancy-to-graph algorithm?

14 visualizaciones (últimos 30 días)
Alex
Alex el 23 de Mayo de 2024
Respondida: Christine Tobler el 24 de Mayo de 2024
I am using the "graph" function for a research project, and I would like to say "graphs are created from adjacency matrices using the MATLAB "graph" function which uses the _____ algorithm," but I don't know the name of the algorithm MATLAB uses. Is there a specific one? Or is it something too basic that it doesn't even have a name. The same question applies to the conncomp function.

Respuesta aceptada

Christine Tobler
Christine Tobler el 24 de Mayo de 2024
The graph object in MATLAB uses an internal data format that is very similar to a sparse adjacency matrix, so the construction of the "graph" object is more of a formatting change, not an algorithm that would have a name.
For conncomp, the algorithm is similarly straightforward. The Wikipedia page cites a 1973 paper by Tarjan & Hopcroft, but this seems to just be summarizing a set of algorithms that were already well-known at the time.
Both constructing a graph and computing the number of components will have complexity O(number of edges + number of nodes).

Más respuestas (0)

Categorías

Más información sobre Graph and Network Algorithms en Help Center y File Exchange.

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by