Name for adjancy-to-graph algorithm?
1 visualizzazione (ultimi 30 giorni)
Mostra commenti meno recenti
Alex
il 23 Mag 2024
Risposto: Christine Tobler
il 24 Mag 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.
0 Commenti
Risposta accettata
Christine Tobler
il 24 Mag 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).
0 Commenti
Più risposte (0)
Vedere anche
Categorie
Scopri di più su Graph and Network Algorithms in Help Center e File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!