Algorithms for finding a fundamental set of cycles for an undirected linear graph
Given the adjacency matrix of the graph, the algorithm presented in this paper finds a spanning tree and then constructs the set of fundamental cycles. Our algorithm is…