equal
deleted
inserted
replaced
371 Node firstNode; |
371 Node firstNode; |
372 }; |
372 }; |
373 |
373 |
374 /// \ingroup semi_adaptors |
374 /// \ingroup semi_adaptors |
375 /// |
375 /// |
376 /// \brief Graph which uses a subset of an other graph's nodes and edges. |
376 /// \brief Graph which uses a subset of another graph's nodes and edges. |
377 /// |
377 /// |
378 /// Graph which uses a subset of an other graph's nodes and edges. This class |
378 /// Graph which uses a subset of another graph's nodes and edges. This class |
379 /// is an alternative to the SubGraphAdaptor which is created for the |
379 /// is an alternative to the SubGraphAdaptor which is created for the |
380 /// same reason. The main difference between the two class that it |
380 /// same reason. The main difference between the two class that it |
381 /// makes linked lists on the unhidden nodes and edges what cause that |
381 /// makes linked lists on the unhidden nodes and edges what cause that |
382 /// on sparse subgraphs the algorithms can be more efficient and some times |
382 /// on sparse subgraphs the algorithms can be more efficient and some times |
383 /// provide better time complexity. On other way this implemetation is |
383 /// provide better time complexity. On other way this implemetation is |
668 EdgesImpl* edges; |
668 EdgesImpl* edges; |
669 }; |
669 }; |
670 |
670 |
671 /// \ingroup semi_adaptors |
671 /// \ingroup semi_adaptors |
672 /// |
672 /// |
673 /// \brief Graph which uses a subset of an other graph's edges. |
673 /// \brief Graph which uses a subset of another graph's edges. |
674 /// |
674 /// |
675 /// Graph which uses a subset of an other graph's edges. This class |
675 /// Graph which uses a subset of another graph's edges. This class |
676 /// is an alternative to the EdgeSubGraphAdaptor which is created for the |
676 /// is an alternative to the EdgeSubGraphAdaptor which is created for the |
677 /// same reason. The main difference between the two class that it |
677 /// same reason. The main difference between the two class that it |
678 /// makes linked lists on the unhidden edges what cause that |
678 /// makes linked lists on the unhidden edges what cause that |
679 /// on sparse subgraphs the algorithms can be more efficient and some times |
679 /// on sparse subgraphs the algorithms can be more efficient and some times |
680 /// provide better time complexity. On other way this implemetation is |
680 /// provide better time complexity. On other way this implemetation is |