419 |
419 |
420 ///The purpose of this graph structure is to handle graphs |
420 ///The purpose of this graph structure is to handle graphs |
421 ///having bidirectional edges. Here the function \c addEdge(u,v) adds a pair |
421 ///having bidirectional edges. Here the function \c addEdge(u,v) adds a pair |
422 ///of oppositely directed edges. |
422 ///of oppositely directed edges. |
423 ///There is a new edge map type called |
423 ///There is a new edge map type called |
424 ///\ref SymListGraph::SymEdgeMap "SymEdgeMap" |
424 ///\ref hugo::SymListGraph::SymEdgeMap "SymEdgeMap" |
425 ///that complements this |
425 ///that complements this |
426 ///feature by |
426 ///feature by |
427 ///storing shared values for the edge pairs. The usual |
427 ///storing shared values for the edge pairs. The usual |
428 ///\ref Graph::EdgeMap "EdgeMap" |
428 ///\ref hugo::skeleton::StaticGraph::EdgeMap "EdgeMap" |
429 ///can be used |
429 ///can be used |
430 ///as well. |
430 ///as well. |
431 /// |
431 /// |
432 ///The oppositely directed edge can also be obtained easily |
432 ///The oppositely directed edge can also be obtained easily |
433 ///using \ref opposite. |
433 ///using \ref hugo::SymListGraph::opposite() "opposite()" member function. |
434 /// |
434 /// |
435 ///Here erase(Edge) deletes a pair of edges. |
435 ///Here erase(Edge) deletes a pair of edges. |
436 /// |
436 /// |
437 ///\todo this date structure need some reconsiderations. Maybe it |
437 ///\todo this date structure need some reconsiderations. Maybe it |
438 ///should be implemented independently from ListGraph. |
438 ///should be implemented independently from ListGraph. |