= Bellman-Ford Visitor Adaptor

Converts a list of event visitors into a BellmanFordVisitor for use with
`bellman_ford_shortest_paths`.

*Defined in:* `<boost/graph/bellman_ford_shortest_paths.hpp>` +
*Models:* BellmanFordVisitor

== Example

[source,cpp]
----
include::example$visitors/bellman_visitor.cpp[]
----

[,text]
----
include::example$visitors/bellman_visitor.txt[]
----

== Synopsis

[source,cpp]
----
template <typename EventVisitorList = null_visitor>
class bellman_visitor;

template <typename EventVisitorList>
bellman_visitor<EventVisitorList>
make_bellman_visitor(EventVisitorList ev_list);
----

== Parameters

[cols="1,3,1",options="header"]
|===
| Parameter | Description | Default

| `EventVisitorList`
| One or more EventVisitors combined with `std::pair`.
| `null_visitor`
|===

== Behavior

Implements all BellmanFordVisitor event points (`examine_edge`, `edge_relaxed`,
`edge_not_relaxed`, `edge_minimized`, `edge_not_minimized`). Each event is
dispatched to the matching EventVisitor in the list. Events with no matching
visitor are ignored.
