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.

Sign up for GitHub

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

Jump to bottom

Path Iterator #16

Open
arnaud-m opened this issue Feb 26, 2012 · 3 comments
Open

Path Iterator #16

arnaud-m opened this issue Feb 26, 2012 · 3 comments

Comments

@arnaud-m
Copy link
Contributor

  • Provide an iterator over the paths of a subtree
  • Restrict the iterator to paths for which the length is in a given range.

It should help for variables, constraints and graphics generation.
@arnaud-m
Copy link
Contributor Author

Add additional tests :

  • Compare node/link iterator to IDs
  • Check consecutive indices for Rank Mapper

@ghost ghost assigned kyo06 Feb 27, 2012
@arnaud-m
Copy link
Contributor Author

Also provide ancestors iterator

@arnaud-m
Copy link
Contributor Author

(dis)equality methods seem incorrect :

  • test the current element
  • but we do not test the iterated subgraph (past (?) and remaining elements)

arnaud-m added a commit that referenced this issue Jun 15, 2012
@arnaud-m
Iterator over ancestors of a node (#16)
b049a54
arnaud-m added a commit that referenced this issue Jun 15, 2012
@arnaud-m
Add an iterator over the paths in a subtree defined by its root node
e604b55 
(ctor parameter) (#16).
arnaud-m added a commit that referenced this issue Jun 15, 2012
@arnaud-m
can compile a generic class pslp_criteria (#16)
3403eac
arnaud-m added a commit that referenced this issue Jun 15, 2012
@arnaud-m
Derive properly pserv_criteria from pslp_criteria (#16)
57b8cc2
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@kyo06 @arnaud-m