equal
deleted
inserted
replaced
442 to.build(from, nodeRefMap, edgeRefMap); |
442 to.build(from, nodeRefMap, edgeRefMap); |
443 } |
443 } |
444 }; |
444 }; |
445 |
445 |
446 } |
446 } |
|
447 |
|
448 /// Check whether a graph is undirected. |
|
449 /// |
|
450 /// This function returns \c true if the given graph is undirected. |
|
451 #ifdef DOXYGEN |
|
452 template <typename GR> |
|
453 bool undirected(const GR& g) { return false; } |
|
454 #else |
|
455 template <typename GR> |
|
456 typename enable_if<UndirectedTagIndicator<GR>, bool>::type |
|
457 undirected(const GR&) { |
|
458 return true; |
|
459 } |
|
460 template <typename GR> |
|
461 typename disable_if<UndirectedTagIndicator<GR>, bool>::type |
|
462 undirected(const GR&) { |
|
463 return false; |
|
464 } |
|
465 #endif |
447 |
466 |
448 /// \brief Class to copy a digraph. |
467 /// \brief Class to copy a digraph. |
449 /// |
468 /// |
450 /// Class to copy a digraph to another digraph (duplicate a digraph). The |
469 /// Class to copy a digraph to another digraph (duplicate a digraph). The |
451 /// simplest way of using it is through the \c digraphCopy() function. |
470 /// simplest way of using it is through the \c digraphCopy() function. |