pub fn cache_friendly_adjacency_matrix<N, E, Ix>( graph: &Graph<N, E, Ix>, ) -> Result<Vec<Vec<E>>>where N: Node + Clone + Debug, E: EdgeWeight + Clone + Zero + Copy, Ix: IndexType,
Cache-friendly adjacency matrix computation for large graphs