I require a code for enumerating all possible spanning trees of an undirected connected graph. By using the Cayley's formula, i first need to take out the total number of spanning trees of a graph and then i need to create that total number of spanning trees through a code.... I'm completely new to matlab and i need to complete my university project as soon as possible.
1. Not sure what you mean by this. There is a '.' Marker used for the nodes.
2. Read the help notes. Rather than using arrows, a different line style is used to represent directed/undirected edges.