Changeset 735:853fcddcf282 in lemon1.2 for lemon/hypercube_graph.h
 Timestamp:
 08/23/09 11:09:22 (10 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/hypercube_graph.h
r617 r735 283 283 /// \brief Hypercube graph class 284 284 /// 285 /// This class implements a special graph type. The nodes of the graph286 /// are indiced with integers withat most \c dim binary digits.285 /// HypercubeGraph implements a special graph type. The nodes of the 286 /// graph are indexed with integers having at most \c dim binary digits. 287 287 /// Two nodes are connected in the graph if and only if their indices 288 288 /// differ only on one position in the binary form. 289 /// This class is completely static and it needs constant memory space. 290 /// Thus you can neither add nor delete nodes or edges. 291 /// 292 /// This type fully conforms to the \ref concepts::Graph "Graph concept". 293 /// Most of its member functions and nested classes are documented 294 /// only in the concept class. 289 295 /// 290 296 /// \note The type of the indices is chosen to \c int for efficiency 291 297 /// reasons. Thus the maximum dimension of this implementation is 26 292 298 /// (assuming that the size of \c int is 32 bit). 293 ///294 /// This graph type fully conforms to the \ref concepts::Graph295 /// "Graph concept".296 299 class HypercubeGraph : public ExtendedHypercubeGraphBase { 297 300 typedef ExtendedHypercubeGraphBase Parent; … … 321 324 /// 322 325 /// Gives back the dimension id of the given edge. 323 /// It is in the [0..dim1] range.326 /// It is in the range <tt>[0..dim1]</tt>. 324 327 int dimension(Edge edge) const { 325 328 return Parent::dimension(edge); … … 329 332 /// 330 333 /// Gives back the dimension id of the given arc. 331 /// It is in the [0..dim1] range.334 /// It is in the range <tt>[0..dim1]</tt>. 332 335 int dimension(Arc arc) const { 333 336 return Parent::dimension(arc);
Note: See TracChangeset
for help on using the changeset viewer.