Changeset - r125:19e82bda606a
« 124:ae7785
126:e1dd2a »
gravatar
deba@inf.elte.hu
deba@inf.elte.hu
Fix bug #83 in graph concept, extender and smart graph
0 4 0
default
4 files changed with 17 insertions and 17 deletions:
lemon/bits/graph_extender.h
7
7
lemon/concepts/digraph.h
4
4
lemon/concepts/graph.h
4
4
lemon/smart_graph.h
2
2
↑ Collapse diff ↑
lemon/bits/graph_extender.h
Ignore white space 2 line context
... ... 
@@ -369,6 +369,6 @@
369 369 
    Node oppositeNode(const Node &n, const Edge &e) const {
370 
      if( n == Parent::source(e))
371 
	return Parent::target(e);
372 
      else if( n == Parent::target(e))
373 
	return Parent::source(e);
370 
      if( n == Parent::u(e))
371 
	return Parent::v(e);
372 
      else if( n == Parent::v(e))
373 
	return Parent::u(e);
374 374 
      else
... ... 
@@ -383,3 +383,3 @@
383 383 
    Arc direct(const Edge &edge, const Node &node) const {
384 
      return Parent::direct(edge, Parent::source(edge) == node);
384 
      return Parent::direct(edge, Parent::u(edge) == node);
385 385 
    }
... ... 
@@ -588,3 +588,3 @@
588 588 
    Node baseNode(const IncEdgeIt &edge) const {
589 
      return edge._direction ? source(edge) : target(edge);
589 
      return edge._direction ? u(edge) : v(edge);
590 590 
    }
... ... 
@@ -594,3 +594,3 @@
594 594 
    Node runningNode(const IncEdgeIt &edge) const {
595 
      return edge._direction ? target(edge) : source(edge);
595 
      return edge._direction ? v(edge) : u(edge);
596 596 
    }
lemon/concepts/digraph.h
Ignore white space 2 line context
... ... 
@@ -469,8 +469,8 @@
469 469 

			




	470
	
	
		
      template <typename RDigraph>


			




	
	470
	
		
      template <typename _Digraph>


			




	471
	471
	
		
      struct Constraints {


			




	472
	472
	
		
        void constraints() {


			




	473
	
	
		
          checkConcept<IterableDigraphComponent<>, Digraph>();


			




	474
	
	
		
	  checkConcept<IDableDigraphComponent<>, Digraph>();


			




	475
	
	
		
          checkConcept<MappableDigraphComponent<>, Digraph>();


			




	
	473
	
		
          checkConcept<IterableDigraphComponent<>, _Digraph>();


			




	
	474
	
		
	  checkConcept<IDableDigraphComponent<>, _Digraph>();


			




	
	475
	
		
          checkConcept<MappableDigraphComponent<>, _Digraph>();


			




	476
	476
	
		
        }

			




        

    

    

    

        

            

                

                    lemon/concepts/graph.h
                

                

                  
                  
                  
                  Ignore white space
                  2 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -733,8 +733,8 @@


			




	733
	733
	
		

			




	734
	
	
		
      template <typename Graph>


			




	
	734
	
		
      template <typename _Graph>


			




	735
	735
	
		
      struct Constraints {


			




	736
	736
	
		
	void constraints() {


			




	737
	
	
		
	  checkConcept<IterableGraphComponent<>, Graph>();


			




	738
	
	
		
	  checkConcept<IDableGraphComponent<>, Graph>();


			




	739
	
	
		
	  checkConcept<MappableGraphComponent<>, Graph>();


			




	
	737
	
		
	  checkConcept<IterableGraphComponent<>, _Graph>();


			




	
	738
	
		
	  checkConcept<IDableGraphComponent<>, _Graph>();


			




	
	739
	
		
	  checkConcept<MappableGraphComponent<>, _Graph>();


			




	740
	740
	
		
	}

			




        

    

    

    

        

            

                

                    lemon/smart_graph.h
                

                

                  
                  
                  
                  Ignore white space
                  2 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -472,4 +472,4 @@


			




	472
	472
	
		

			




	473
	
	
		
    Node source(Edge e) const { return Node(arcs[2 * e._id].target); }


			




	474
	
	
		
    Node target(Edge e) const { return Node(arcs[2 * e._id + 1].target); }


			




	
	473
	
		
    Node u(Edge e) const { return Node(arcs[2 * e._id].target); }


			




	
	474
	
		
    Node v(Edge e) const { return Node(arcs[2 * e._id + 1].target); }


			




	475
	475
	
		

			




        

    






    
    



    


    

     
    
0 comments (0 inline)