equal
deleted
inserted
replaced
285 /// HypercubeGraph implements a special graph type. The nodes of the |
285 /// HypercubeGraph implements a special graph type. The nodes of the |
286 /// graph are indexed with integers having at most \c dim binary digits. |
286 /// graph are indexed with integers having at most \c dim binary digits. |
287 /// Two nodes are connected in the graph if and only if their indices |
287 /// Two nodes are connected in the graph if and only if their indices |
288 /// differ only on one position in the binary form. |
288 /// differ only on one position in the binary form. |
289 /// This class is completely static and it needs constant memory space. |
289 /// This class is completely static and it needs constant memory space. |
290 /// Thus you can neither add nor delete nodes or edges, however |
290 /// Thus you can neither add nor delete nodes or edges, however, |
291 /// the structure can be resized using resize(). |
291 /// the structure can be resized using resize(). |
292 /// |
292 /// |
293 /// This type fully conforms to the \ref concepts::Graph "Graph concept". |
293 /// This type fully conforms to the \ref concepts::Graph "Graph concept". |
294 /// Most of its member functions and nested classes are documented |
294 /// Most of its member functions and nested classes are documented |
295 /// only in the concept class. |
295 /// only in the concept class. |