java - Fastest way to traverse all edge of a directed attributed graph which stores in adjacency matrix -


i have adjacency matrix represent directed attributed graph. want traverse of edge of graph. 1 way traverse rows of matrix problem when number of rows more 10000 performance of traversing edges degrade significantly. want know there efficient way that?

bfs , dfs explained here: http://opendatastructures.org/ods-java/12_3_graph_traversal.html


Comments

Popular posts from this blog

How has firefox/gecko HTML+CSS rendering changed in version 38? -

javascript - Complex json ng-repeat -

jquery - Cloning of rows and columns from the old table into the new with colSpan and rowSpan -