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
Post a Comment