Package rosetta :: Package core :: Package graph :: Module _core_graph_
[hide private]
[frames] | no frames]

Module _core_graph_

Classes [hide private]
  DS_Node
core/graph/DisjointSets.hh:30
  DS_NodeAP
  DS_NodeCAP
  DisjointSets
core/graph/DisjointSets.hh:37
  DisjointSetsAP
  DisjointSetsCAP
  Edge
core/graph/Graph.hh:552
  EdgeAP
  EdgeCAP
  EdgeList
Custom edge list class.
  EdgeListAP
  EdgeListCAP
  EdgeListConstIterator
Custom Edge list const iterator class, which returns only const Edge pointers.
  EdgeListConstIteratorAP
  EdgeListConstIteratorCAP
  EdgeListElement
An extensible graph class Nodes are identified by positive integers -- each node is assigned a unique integer starting at 1.
  EdgeListElementAP
  EdgeListElementCAP
  EdgeListIterator
Custom Edge list (non-const) iterator class, which can return non-const Edge pointers.
  EdgeListIteratorAP
  EdgeListIteratorCAP
  Graph
A Graph with constant time edge insertion and deletion.
  GraphAP
  GraphCAP
  Node
core/graph/Graph.hh:402
  NodeAP
  NodeCAP
  __CPP_Edge__
  __CPP_Graph__
  __CPP_Node__
Functions [hide private]
 
delete_all_intragroup_edges(...)
delete_all_intragroup_edges( (Graph)g, (vector1_Size)node_groups) -> None : core/graph/graph_util.hh:42
 
find_connected_components(...)
find_connected_components( (Graph)g) -> vector1_pair_Size_Size : returns a vector1 of connected component descriptions: each entry holds the connected-component size and a representative vertex from that connected component.
Variables [hide private]
  __package__ = None
Function Details [hide private]

delete_all_intragroup_edges(...)

 

delete_all_intragroup_edges( (Graph)g, (vector1_Size)node_groups) -> None :
    core/graph/graph_util.hh:42

    C++ signature :
        void delete_all_intragroup_edges(core::graph::Graph {lvalue},utility::vector1<unsigned long, std::allocator<unsigned long> >)

find_connected_components(...)

 

find_connected_components( (Graph)g) -> vector1_pair_Size_Size :
    returns a vector1 of connected component descriptions:
    each entry holds the connected-component size
    and a representative vertex from that connected component.
    O( V+E ).
    

    C++ signature :
        utility::vector1<std::pair<unsigned long, unsigned long>, std::allocator<std::pair<unsigned long, unsigned long> > > find_connected_components(core::graph::Graph)