Changeset - r736:2e20aad15754
« 735:853fcd
737:9d6c3e »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Add reserve functions to ListGraph and SmartGraph (#311) ListDigraph and SmartDigraph already have such functions.
0 4 0
default
4 files changed with 46 insertions and 0 deletions:
lemon/list_graph.h
20
lemon/smart_graph.h
20
test/digraph_test.cc
3
test/graph_test.cc
3
↑ Collapse diff ↑
lemon/list_graph.h
Ignore white space 6 line context
... ... 
@@ -1308,12 +1308,32 @@
1308 1308 
    ///This function erases all nodes and arcs from the graph.
1309 1309 
    ///
1310 1310 
    void clear() {
1311 1311 
      Parent::clear();
1312 1312 
    }
1313 1313 

			




	
	1314
	
		
    /// Reserve memory for nodes.


			




	
	1315
	
		

			




	
	1316
	
		
    /// Using this function, it is possible to avoid superfluous memory


			




	
	1317
	
		
    /// allocation: if you know that the graph you want to build will


			




	
	1318
	
		
    /// be large (e.g. it will contain millions of nodes and/or edges),


			




	
	1319
	
		
    /// then it is worth reserving space for this amount before starting


			




	
	1320
	
		
    /// to build the graph.


			




	
	1321
	
		
    /// \sa reserveEdge()


			




	
	1322
	
		
    void reserveNode(int n) { nodes.reserve(n); };


			




	
	1323
	
		

			




	
	1324
	
		
    /// Reserve memory for edges.


			




	
	1325
	
		

			




	
	1326
	
		
    /// Using this function, it is possible to avoid superfluous memory


			




	
	1327
	
		
    /// allocation: if you know that the graph you want to build will


			




	
	1328
	
		
    /// be large (e.g. it will contain millions of nodes and/or edges),


			




	
	1329
	
		
    /// then it is worth reserving space for this amount before starting


			




	
	1330
	
		
    /// to build the graph.


			




	
	1331
	
		
    /// \sa reserveNode()


			




	
	1332
	
		
    void reserveEdge(int m) { arcs.reserve(2 * m); };


			




	
	1333
	
		

			




	1314
	1334
	
		
    /// \brief Class to make a snapshot of the graph and restore


			




	1315
	1335
	
		
    /// it later.


			




	1316
	1336
	
		
    ///


			




	1317
	1337
	
		
    /// Class to make a snapshot of the graph and restore it later.


			




	1318
	1338
	
		
    ///


			




	1319
	1339
	
		
    /// The newly added nodes and edges can be removed

			




        

    

    

    

        

            

                

                    lemon/smart_graph.h
                

                

                  
                  
                  
                  Ignore white space
                  6 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -688,12 +688,32 @@


			




	688
	688
	
		
    ///This function erases all nodes and arcs from the graph.


			




	689
	689
	
		
    ///


			




	690
	690
	
		
    void clear() {


			




	691
	691
	
		
      Parent::clear();


			




	692
	692
	
		
    }


			




	693
	693
	
		

			




	
	694
	
		
    /// Reserve memory for nodes.


			




	
	695
	
		

			




	
	696
	
		
    /// Using this function, it is possible to avoid superfluous memory


			




	
	697
	
		
    /// allocation: if you know that the graph you want to build will


			




	
	698
	
		
    /// be large (e.g. it will contain millions of nodes and/or edges),


			




	
	699
	
		
    /// then it is worth reserving space for this amount before starting


			




	
	700
	
		
    /// to build the graph.


			




	
	701
	
		
    /// \sa reserveEdge()


			




	
	702
	
		
    void reserveNode(int n) { nodes.reserve(n); };


			




	
	703
	
		

			




	
	704
	
		
    /// Reserve memory for edges.


			




	
	705
	
		

			




	
	706
	
		
    /// Using this function, it is possible to avoid superfluous memory


			




	
	707
	
		
    /// allocation: if you know that the graph you want to build will


			




	
	708
	
		
    /// be large (e.g. it will contain millions of nodes and/or edges),


			




	
	709
	
		
    /// then it is worth reserving space for this amount before starting


			




	
	710
	
		
    /// to build the graph.


			




	
	711
	
		
    /// \sa reserveNode()


			




	
	712
	
		
    void reserveEdge(int m) { arcs.reserve(2 * m); };


			




	
	713
	
		

			




	694
	714
	
		
  public:


			




	695
	715
	
		

			




	696
	716
	
		
    class Snapshot;


			




	697
	717
	
		

			




	698
	718
	
		
  protected:


			




	699
	719
	
		

			




        

    

    

    

        

            

                

                    test/digraph_test.cc
                

                

                  
                  
                  
                  Ignore white space
                  12 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -32,12 +32,15 @@


			




	32
	32
	
		
  TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);


			




	33
	33
	
		
  Digraph G;


			




	34
	34
	
		

			




	35
	35
	
		
  checkGraphNodeList(G, 0);


			




	36
	36
	
		
  checkGraphArcList(G, 0);


			




	37
	37
	
		

			




	
	38
	
		
  G.reserveNode(3);


			




	
	39
	
		
  G.reserveArc(4);


			




	
	40
	
		

			




	38
	41
	
		
  Node


			




	39
	42
	
		
    n1 = G.addNode(),


			




	40
	43
	
		
    n2 = G.addNode(),


			




	41
	44
	
		
    n3 = G.addNode();


			




	42
	45
	
		
  checkGraphNodeList(G, 3);


			




	43
	46
	
		
  checkGraphArcList(G, 0);

			




        

    

    

    

        

            

                

                    test/graph_test.cc
                

                

                  
                  
                  
                  Ignore white space
                  6 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -35,12 +35,15 @@


			




	35
	35
	
		

			




	36
	36
	
		
  Graph G;


			




	37
	37
	
		
  checkGraphNodeList(G, 0);


			




	38
	38
	
		
  checkGraphEdgeList(G, 0);


			




	39
	39
	
		
  checkGraphArcList(G, 0);


			




	40
	40
	
		

			




	
	41
	
		
  G.reserveNode(3);


			




	
	42
	
		
  G.reserveEdge(3);


			




	
	43
	
		

			




	41
	44
	
		
  Node


			




	42
	45
	
		
    n1 = G.addNode(),


			




	43
	46
	
		
    n2 = G.addNode(),


			




	44
	47
	
		
    n3 = G.addNode();


			




	45
	48
	
		
  checkGraphNodeList(G, 3);


			




	46
	49
	
		
  checkGraphEdgeList(G, 0);


			




        

    






    
    



    


    

     
    
0 comments (0 inline)