-
Notifications
You must be signed in to change notification settings - Fork 0
Open
Description
| boost::two_graphs_common_spanning_trees |
Given Output is:
Iterate over iG_o
(0,1) (0,2) (0,3) (0,4) (1,2) (3,4)
Iterate over vG_o
(1,2) (2,0) (2,3) (4,3) (0,3) (0,4)
Reading trees
1 1 1 1 0 0
1 1 1 0 0 1
1 1 0 1 0 1
1 0 1 1 1 0
1 0 1 0 1 1
If we focus on 1st row that is 1 1 1 1 0 0 Then it means common spanning tree have (0,1) (0,2) (0,3) (0,4) edges but edge (0,1) is not present in the vG_o then how it would be in common spanning tree??
Reactions are currently unavailable
Metadata
Metadata
Assignees
Labels
No labels