Ticket #1047 (new enhancement)

Opened 1 year ago

Last modified 1 year ago

graphs: Create the "visitor" concept in Boost

Reported by: jason Assigned to: was
Priority: major Milestone: sage-wishlist
Component: graph theory Keywords:
Cc:

Description

Boost has a "visitor" concept. Basically, you pass a graph traversal method an object. As the graph traversal function goes through the graph, it invokes functions from your object. So it's easy to do a depth-first something, for example. It applies to stuff beyond depth-first and breadth-first too, for example, creating a spanning tree, etc.

See [http://www.boost.org/libs/graph/doc/visitor_concepts.html]

Change History

12/17/2007 07:10:42 AM changed by rlm

  • keywords deleted.
  • component changed from combinatorics to graph theory.