equal
deleted
inserted
replaced
243 /// |
243 /// |
244 /// \note By definition, the empty graph is strongly connected. |
244 /// \note By definition, the empty graph is strongly connected. |
245 template <typename Graph> |
245 template <typename Graph> |
246 bool stronglyConnected(const Graph& graph) { |
246 bool stronglyConnected(const Graph& graph) { |
247 checkConcept<concept::StaticGraph, Graph>(); |
247 checkConcept<concept::StaticGraph, Graph>(); |
248 if (NodeIt(graph) == INVALID) return true; |
|
249 |
248 |
250 typedef typename Graph::Node Node; |
249 typedef typename Graph::Node Node; |
251 typedef typename Graph::NodeIt NodeIt; |
250 typedef typename Graph::NodeIt NodeIt; |
|
251 |
|
252 if (NodeIt(graph) == INVALID) return true; |
252 |
253 |
253 using namespace _topology_bits; |
254 using namespace _topology_bits; |
254 |
255 |
255 typedef DfsVisitor<Graph> Visitor; |
256 typedef DfsVisitor<Graph> Visitor; |
256 Visitor visitor; |
257 Visitor visitor; |