Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Not Expected Output #1

Open
prakashupes opened this issue Jul 22, 2020 · 0 comments
Open

Not Expected Output #1

prakashupes opened this issue Jul 22, 2020 · 0 comments

Comments

@prakashupes
Copy link
Owner

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??

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant