MCPcopy Create free account
hub / github.com/BirolLab/abyss / nextVertex

Method nextVertex

Graph/DirectedGraph.h:152–166  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

150 : public std::iterator<std::input_iterator_tag, edge_descriptor>
151{
152 void nextVertex()
153 {
154 vertex_iterator vlast = m_g->vertices().second;
155 for (; m_vit != vlast; ++m_vit) {
156 std::pair<adjacency_iterator, adjacency_iterator>
157 adj = m_g->adjacent_vertices(*m_vit);
158 if (adj.first != adj.second) {
159 m_eit = adj.first;
160 return;
161 }
162 }
163 // Set m_eit to a known value.
164 static const adjacency_iterator s_eitNULL;
165 m_eit = s_eitNULL;
166 }
167
168 public:
169 edge_iterator() { }

Callers

nothing calls this directly

Calls 2

verticesMethod · 0.80
adjacent_verticesMethod · 0.45

Tested by

no test coverage detected