performance - Running time for algorithms that solve graph problems -


when people talk algorithms solve graph problems, input taken account running time - number of vertices, number of edges, both or either? put differently, o(|v|), o(|e|) , o(|v||e|) valid polynomial running times graphing algorithms? matter if 1 of |v| or |e| bigger other?

both may relevant, depending on algorithm. input(s) has significant impact used compute complexity.

you can have @ link few examples of complexity of known graph algorithms: http://bigocheatsheet.com/. can see either 1 of |v| or |e| appears, both.


Comments

Popular posts from this blog

apache - Remove .php and add trailing slash in url using htaccess not loading css -

javascript - jQuery show full size image on click -