Changeset - r357:3fb8ed1322de
« 352:7c5d8d
« 356:99f1bd
379:1bab3a »
364:b4a014 »
360:75cf49 »
358:636fa2 »
gravatar
alpar (Alpar Juttner)
alpar@cs.elte.hu
Merge
0 2 0
merge default
0 files changed with 16 insertions and 16 deletions:
doc/groups.dox
8
1
lemon/nauty_reader.h
8
15
↑ Collapse diff ↑
doc/groups.dox
Ignore white space 6 line context
... ... 
@@ -466,3 +466,3 @@
466 466 
/**
467 
@defgroup lemon_io LEMON Input-Output
467 
@defgroup lemon_io LEMON Graph Format
468 468 
@ingroup io_group
... ... 
@@ -484,2 +484,9 @@
484 484 
/**
485 
@defgroup nauty_group NAUTY Format
486 
@ingroup io_group
487 
\brief Read \e Nauty format
488 
Tool to read graphs from \e Nauty format data.
489 
*/
490 

			




	
	491
	
		
/**


			




	485
	492
	
		
@defgroup concept Concepts

			




        

    

    

    

        

            

                

                    lemon/nauty_reader.h
                

                

                  
                  
                  
                  Show white space
                  6 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -25,10 +25,2 @@


			




	25
	25
	
		

			




	26
	
	
		
/// \ingroup io_group


			




	27
	
	
		
///


			




	28
	
	
		
/// @defgroup nauty_group NAUTY format


			




	29
	
	
		
///


			




	30
	
	
		
/// \brief Read \e Nauty format


			




	31
	
	
		
///


			




	32
	
	
		
/// Tool to read graphs from \e Nauty format data


			




	33
	
	
		

			




	34
	26
	
		
/// \ingroup nauty_group


			




	...
	...
	
		
@@ -36,2 +28,3 @@


			




	36
	28
	
		
/// \brief Nauty file reader.


			




	
	29
	
		

			




	37
	30
	
		
namespace lemon {


			




	...
	...
	
		
@@ -44,6 +37,6 @@


			




	44
	37
	
		
  /// package. This tool can generate all non-isomorphic undirected


			




	45
	
	
		
  /// graphs with given node number from several classes (for example,


			




	
	38
	
		
  /// graphs of several classes with given node number (e.g.


			




	46
	39
	
		
  /// general, connected, biconnected, triangle-free, 4-cycle-free,


			




	47
	40
	
		
  /// bipartite and graphs with given edge number and degree


			




	48
	
	
		
  /// constraints). This function reads a \e nauty \e graph6 \e format


			




	
	41
	
		
  /// constraints). This function reads a \e nauty \e graph \e format


			




	49
	42
	
		
  /// line from the given stream and builds it in the given graph.


			




	...
	...
	
		
@@ -52,4 +45,4 @@


			




	52
	45
	
		
  ///


			




	53
	
	
		
  /// For example, the number of all non-isomorphic connected graphs


			




	54
	
	
		
  /// can be computed with following code.


			




	
	46
	
		
  /// For example, the number of all non-isomorphic planar graphs


			




	
	47
	
		
  /// can be computed with the following code.


			




	55
	48
	
		
  ///\code


			




	...
	...
	
		
@@ -65,8 +58,8 @@


			




	65
	58
	
		
  /// The nauty files are quite huge, therefore instead of the direct


			




	66
	
	
		
  /// file generation the pipelining is recommended.


			




	
	59
	
		
  /// file generation pipelining is recommended. For example,


			




	67
	60
	
		
  ///\code


			




	68
	
	
		
  /// ./geng -c 10 | ./num_of_pg


			




	
	61
	
		
  /// ./geng -c 10 | ./num_of_planar_graphs


			




	69
	62
	
		
  ///\endcode


			




	70
	63
	
		
  template <typename Graph>


			




	71
	
	
		
  std::istream& readNauty(Graph& graph, std::istream& is) {


			




	
	64
	
		
  std::istream& readNauty(Graph& graph, std::istream& is = std::cin) {


			




	72
	65
	
		
    graph.clear();


			




        

    






    
    



    


    

     
    
0 comments (0 inline)