Name for adjancy-to-graph algorithm?
1 Ansicht (letzte 30 Tage)
Ältere Kommentare anzeigen
Alex
am 23 Mai 2024
Beantwortet: Christine Tobler
am 24 Mai 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 Kommentare
Akzeptierte Antwort
Christine Tobler
am 24 Mai 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 Kommentare
Weitere Antworten (0)
Siehe auch
Kategorien
Mehr zu Graph and Network Algorithms finden Sie in Help Center und File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!