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

Question

I have a adjacency matrix which represent a directed attributed graph. Now I want to traverse all of the edge of the graph. One way is too traverse all rows of the matrix but my problem is that when the number of rows are more than 10000 the performance of traversing edges degrade significantly. So I want to know is there any efficient way to do that?

Answer 1

BFS and DFS are explained here: http://opendatastructures.org/ods-java/12_3_Graph_Traversal.html