Cycle basis for large graph
2 次查看（过去 30 天）
As per my understanding of the question, when dealing with large graphs such as the one you described, calculating the cycle basis using the cyclebasis(G) command in MATLAB may not be feasible due to memory constraints.
One way to solve this problem is to use a smaller representation of the graph. For example, you could use a sparse matrix representation, which would use less memory than a dense matrix representation
Finally, you could try to reduce the size of the graph by removing some of the edges. This could be done by using a graph simplification algorithm, such as the Kruskal algorithm or the Prim algorithm.
I hope the above information helps resolve your query.