#include <mlGraphToBoostUndirectedGraph.h>
Public Member Functions | |
| ml_ug_out_edge_iterator () | |
| ml_ug_out_edge_iterator (ml::GraphNode *vertex, std::vector< ml::GraphEdge * >::iterator edgeIter) | |
| boost::ml_ug_edge | operator* () |
| self & | operator++ () |
Protected Attributes | |
| ml::GraphNode * | _vertex |
| std::vector< ml::GraphEdge * > ::iterator | _edgeIter |
Friends | |
| bool | operator== (const self &x, const self &y) |
Since we want an undirected graph, we must wrap the ml::GraphEdges in a boost::ml_ug_edge object, so we get a default direction (always away from vertex).
Definition at line 192 of file mlGraphToBoostUndirectedGraph.h.
| ml_ug_out_edge_iterator::ml_ug_out_edge_iterator | ( | ) | [inline] |
Definition at line 204 of file mlGraphToBoostUndirectedGraph.h.
| ml_ug_out_edge_iterator::ml_ug_out_edge_iterator | ( | ml::GraphNode * | vertex, | |
| std::vector< ml::GraphEdge * >::iterator | edgeIter | |||
| ) | [inline] |
Definition at line 206 of file mlGraphToBoostUndirectedGraph.h.
| boost::ml_ug_edge ml_ug_out_edge_iterator::operator* | ( | ) | [inline] |
| self& ml_ug_out_edge_iterator::operator++ | ( | void | ) | [inline] |
Definition at line 220 of file mlGraphToBoostUndirectedGraph.h.
std::vector<ml::GraphEdge*>::iterator ml_ug_out_edge_iterator::_edgeIter [protected] |
Definition at line 225 of file mlGraphToBoostUndirectedGraph.h.
Referenced by operator*(), and operator++().
ml::GraphNode* ml_ug_out_edge_iterator::_vertex [protected] |
1.5.8