#include <stanford_graph.hpp>
 | 
| template<class Ref >  | 
| class  | sgb_edge_length_map | 
|   | 
| template<class Tag , class Ref >  | 
| class  | sgb_edge_util_map | 
|   | 
| Vertex *  | source (self e, sgb_const_graph_ptr) | 
|   | 
| Vertex *  | target (self e, sgb_const_graph_ptr) | 
|   | 
| bool  | operator== (const self &a, const self &b) | 
|   | 
| bool  | operator!= (const self &a, const self &b) | 
|   | 
| long  | get (edge_length_t, const sgb_graph_ptr &, const sgb_edge &key) | 
|   | 
| long  | get (edge_length_t, const sgb_const_graph_ptr &, const sgb_edge &key) | 
|   | 
| void  | put (edge_length_t, sgb_graph_ptr &, const sgb_edge &key, long value) | 
|   | 
  
  
      
        
          | boost::sgb_edge::sgb_edge  | 
          ( | 
           | ) | 
           | 
         
       
   | 
  
inline   | 
  
 
 
  
  
      
        
          | boost::sgb_edge::sgb_edge  | 
          ( | 
          Arc *  | 
          a,  | 
         
        
           | 
           | 
          Vertex *  | 
          s  | 
         
        
           | 
          ) | 
           |  | 
         
       
   | 
  
inline   | 
  
 
 
  
  
      
        
          | bool operator==  | 
          ( | 
          const self &  | 
          a,  | 
         
        
           | 
           | 
          const self &  | 
          b  | 
         
        
           | 
          ) | 
           |  | 
         
       
   | 
  
friend   | 
  
 
 
template<class Tag , class Ref > 
 
 
  
  
      
        
          | Arc* boost::sgb_edge::_arc | 
         
       
   | 
  
protected   | 
  
 
 
The documentation for this class was generated from the following file: