Changeset 826:056fbb112b30 in lemon-0.x for src
- Timestamp:
- 09/09/04 11:18:41 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1122
- Location:
- src
- Files:
-
- 5 edited
Legend:
- Unmodified
- Added
- Removed
-
src/hugo/skeletons/graph.h
r801 r826 457 457 /// This function deletes all edges and nodes of the graph. 458 458 /// It also frees the memory allocated to store them. 459 /// \todo It might belong to \c Eras eableGraphSkeleton.459 /// \todo It might belong to \c ErasableGraphSkeleton. 460 460 void clear() { } 461 461 }; 462 462 463 /// An empty eras eable graph class.463 /// An empty erasable graph class. 464 464 465 465 /// This class is an extension of \c GraphSkeleton. It also makes it 466 466 /// possible to erase edges or nodes. 467 class Eras eableGraphSkeleton : public GraphSkeleton467 class ErasableGraphSkeleton : public GraphSkeleton 468 468 { 469 469 public: … … 472 472 /// Defalult constructor. 473 473 /// 474 Eras eableGraphSkeleton() { }474 ErasableGraphSkeleton() { } 475 475 /// Deletes a node. 476 476 -
src/test/graph_test.cc
r800 r826 59 59 (skeleton::GraphSkeleton &); 60 60 61 template void checkCompileErasableGraph<skeleton::Eras eableGraphSkeleton>62 (skeleton::Eras eableGraphSkeleton &);61 template void checkCompileErasableGraph<skeleton::ErasableGraphSkeleton> 62 (skeleton::ErasableGraphSkeleton &); 63 63 64 64 //Compile SmartGraph -
src/work/marci/graph_concept.h
r652 r826 400 400 401 401 402 /// \brief Node-eras eable graph concept.402 /// \brief Node-erasable graph concept. 403 403 /// 404 404 /// A graph class which provides a function to 405 405 /// delete any of its nodes. 406 class NodeEras eableGraphConcept : virtual public GraphConcept406 class NodeErasableGraphConcept : virtual public GraphConcept 407 407 { 408 408 public: … … 412 412 413 413 414 /// \brief Edge-eras eable graph concept.414 /// \brief Edge-erasable graph concept. 415 415 /// 416 416 /// A graph class which provides a function to delete any 417 417 /// of its edges. 418 class EdgeEras eableGraphConcept : virtual public GraphConcept418 class EdgeErasableGraphConcept : virtual public GraphConcept 419 419 { 420 420 public: -
src/work/peter/edgepathgraph.h
r677 r826 365 365 }; 366 366 367 /// An empty eras eable graph class.367 /// An empty erasable graph class. 368 368 369 /// This class provides all the common features of an \e eras eable graph369 /// This class provides all the common features of an \e erasable graph 370 370 /// structure, 371 371 /// however completely without implementations and real data structures … … 385 385 /// @ref SmartGraph will just refer to this structure. 386 386 template <typename P, typename Gact, typename Gsub> 387 class Eras eableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub>387 class ErasableEdgePathGraph : public EdgePathGraph<P, Gact, Gsub> 388 388 { 389 389 public: … … 394 394 395 395 /// Defalult constructor. 396 Eras eableEdgePathGraph() {}396 ErasableEdgePathGraph() {} 397 397 ///Copy consructor. 398 Eras eableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {}398 ErasableEdgePathGraph(const EdgePathGraph<P, Gact, Gsub> &EPG) {} 399 399 }; 400 400 -
src/work/peter/hierarchygraph.h
r691 r826 528 528 }; 529 529 530 /// An empty eras eable graph class.531 532 /// This class provides all the common features of an \e eras eable graph530 /// An empty erasable graph class. 531 532 /// This class provides all the common features of an \e erasable graph 533 533 /// structure, 534 534 /// however completely without implementations and real data structures … … 547 547 /// like @ref ListGraph or 548 548 /// @ref SmartGraph will just refer to this structure. 549 template < typename Gact, typename Gsub > class Eras eableHierarchyGraph:public HierarchyGraph < Gact,549 template < typename Gact, typename Gsub > class ErasableHierarchyGraph:public HierarchyGraph < Gact, 550 550 Gsub 551 551 > … … 564 564 565 565 /// Defalult constructor. 566 Eras eableHierarchyGraph ()566 ErasableHierarchyGraph () 567 567 { 568 568 } 569 569 ///Copy consructor. 570 Eras eableHierarchyGraph (const HierarchyGraph < Gact, Gsub > &EPG)570 ErasableHierarchyGraph (const HierarchyGraph < Gact, Gsub > &EPG) 571 571 { 572 572 }
Note: See TracChangeset
for help on using the changeset viewer.