equal
deleted
inserted
replaced
1324 /// the degrees are stored in a standard NodeMap, so each query is done |
1324 /// the degrees are stored in a standard NodeMap, so each query is done |
1325 /// in constant time. On the other hand, the values are updated automatically |
1325 /// in constant time. On the other hand, the values are updated automatically |
1326 /// whenever the graph changes. |
1326 /// whenever the graph changes. |
1327 /// |
1327 /// |
1328 /// \warning Besides addNode() and addEdge(), a graph structure may provide |
1328 /// \warning Besides addNode() and addEdge(), a graph structure may provide |
1329 /// alternative ways to mogify the graph. The correct behavior of InDegMap |
1329 /// alternative ways to modify the graph. The correct behavior of InDegMap |
1330 /// is not guarantied if these additional featureas are used. For example |
1330 /// is not guarantied if these additional featureas are used. For example |
1331 /// the funstions \ref ListGraph::changeSource() "changeSource()", |
1331 /// the funstions \ref ListGraph::changeSource() "changeSource()", |
1332 /// \ref ListGraph::changeTarget() "changeTarget()" and |
1332 /// \ref ListGraph::changeTarget() "changeTarget()" and |
1333 /// \ref ListGraph::reverseEdge() "reverseEdge()" |
1333 /// \ref ListGraph::reverseEdge() "reverseEdge()" |
1334 /// of \ref ListGraph will \e not update the degree values correctly. |
1334 /// of \ref ListGraph will \e not update the degree values correctly. |
1430 /// the degrees are stored in a standard NodeMap, so each query is done |
1430 /// the degrees are stored in a standard NodeMap, so each query is done |
1431 /// in constant time. On the other hand, the values are updated automatically |
1431 /// in constant time. On the other hand, the values are updated automatically |
1432 /// whenever the graph changes. |
1432 /// whenever the graph changes. |
1433 /// |
1433 /// |
1434 /// \warning Besides addNode() and addEdge(), a graph structure may provide |
1434 /// \warning Besides addNode() and addEdge(), a graph structure may provide |
1435 /// alternative ways to mogify the graph. The correct behavior of OutDegMap |
1435 /// alternative ways to modify the graph. The correct behavior of OutDegMap |
1436 /// is not guarantied if these additional featureas are used. For example |
1436 /// is not guarantied if these additional featureas are used. For example |
1437 /// the funstions \ref ListGraph::changeSource() "changeSource()", |
1437 /// the funstions \ref ListGraph::changeSource() "changeSource()", |
1438 /// \ref ListGraph::changeTarget() "changeTarget()" and |
1438 /// \ref ListGraph::changeTarget() "changeTarget()" and |
1439 /// \ref ListGraph::reverseEdge() "reverseEdge()" |
1439 /// \ref ListGraph::reverseEdge() "reverseEdge()" |
1440 /// of \ref ListGraph will \e not update the degree values correctly. |
1440 /// of \ref ListGraph will \e not update the degree values correctly. |