Changeset - r358:636fa2f39f10
« 357:3fb8ed
359:0eec17 »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Redo erroneous modification of [7c5d8de2eac7] (#55)
0 1 0
default
1 file changed with 1 insertions and 1 deletions:
lemon/nauty_reader.h
1
1
↑ Collapse diff ↑
lemon/nauty_reader.h
Show white space 24 line context
... ... 
@@ -29,25 +29,25 @@
29 29 

			




	30
	30
	
		
namespace lemon {


			




	31
	31
	
		

			




	32
	32
	
		
  /// \ingroup nauty_group


			




	33
	33
	
		
  ///


			




	34
	34
	
		
  /// \brief Nauty file reader


			




	35
	35
	
		
  ///


			




	36
	36
	
		
  /// The \e geng program is in the \e gtools suite of the nauty


			




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


			




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


			




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


			




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


			




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


			




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


			




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


			




	43
	43
	
		
  ///


			




	44
	44
	
		
  /// The site of nauty package: http://cs.anu.edu.au/~bdm/nauty/


			




	45
	45
	
		
  ///


			




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


			




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


			




	48
	48
	
		
  ///\code


			




	49
	49
	
		
  /// int num = 0;


			




	50
	50
	
		
  /// SmartGraph graph;


			




	51
	51
	
		
  /// while (readNauty(graph, std::cin)) {


			




	52
	52
	
		
  ///   PlanarityChecking<SmartGraph> pc(graph);


			




	53
	53
	
		
  ///   if (pc.run()) ++num;


			




        

    






    
    



    


    

     
    
0 comments (0 inline)