Workspaces ---- apbd asves asvpapers bear blast caltrop cases concurrency cosi dif diva dopcenter dopresence dopsysadmin eecsx44 elab embedded embeddedadmin giotto hyinfo m2t2 mescal metropolis mica mobies msgadmin murieh mvsis nephest ransom recons robosysadmin savg sec seminar smartnets video webmaster

cosi::IdUndirectedGraph Class Reference #include <IdUndirectedGraph.h> Inheritance diagram for cosi::IdUndirectedGraph: List of all members. Public Types typedef std::list< int >::iterator  list_iterator typedef std::set< int >::iterator  v_iterator Public Member Functions   IdUndirectedGraph (std::string pName) virtual  ~IdUndirectedGraph () int  Degree (int r) Vertex  AddVertex () int  GetLastId () void  AddVertex (int Id) void  DeleteVertex (int Id) bool  InV (int V) bool  InE (int i, int j) bool  InE (Edge pE) void  AddEdge (int i, int j) void  AddEdge (Edge pE) void  DeleteEdge (int i, int j) void  DeleteEdge (Edge pE) int  Order () int  Size () list_iterator  adj_begin (int V)   Returns the begin iterator to the list of vertices connected to V. list_iterator  adj_end (int V)   Returns the end iterator to the list of vertices connected to V. v_iterator  v_begin ()   Returns the begin iterator to the set of vertexes. v_iterator  v_end ()   Returns the end iterator to the set of vertexes. std::string  GetName () const   Returns the name of the graph. void  SetName (std::string pName)   Sets the name of the graph. void  SetName (int V, std::string pName)   Sets the name of a vertex. void  SetName (int U, int V, std::string pName)   Sets the name of an edge. void  SetName (Edge pE, std::string pName) std::string  GetName (int V)   Get the name of the a vertex. std::string  GetName (int U, int V)   Get the name of the an edge. std::string  GetName (Edge pE) virtual string  Print () virtual string  PrintNode (int V) virtual string  PrintEdge (int U, int V) virtual string  PrintEdge (Edge pE) Private Attributes std::map< int, std::list< int > >  mAdjList   Adj List. std::set< int >  mV int  mSize   Number of edges in the graph. string  mName   Name of the graph. std::map< int, std::string >  mNodeName std::map< std::pair< int, int >, std::string >  mEdgeName int  mLastId Member Typedef Documentation typedef std::list<int>::iterator cosi::IdUndirectedGraph::list_iterator typedef std::set<int>::iterator cosi::IdUndirectedGraph::v_iterator Constructor & Destructor Documentation cosi::IdUndirectedGraph::IdUndirectedGraph ( std::string  pName  )  cosi::IdUndirectedGraph::~IdUndirectedGraph (  )  [virtual] Member Function Documentation int cosi::IdUndirectedGraph::Degree ( int  r  )  Vertex cosi::IdUndirectedGraph::AddVertex (  )  int cosi::IdUndirectedGraph::GetLastId (  )  void cosi::IdUndirectedGraph::AddVertex ( int  Id  )  Reimplemented in cosi::U_CommunicationStructure< L >, and cosi::U_CommunicationStructure< cosi::Label_1 >. void cosi::IdUndirectedGraph::DeleteVertex ( int  Id  )  Reimplemented in cosi::U_CommunicationStructure< L >, and cosi::U_CommunicationStructure< cosi::Label_1 >. bool cosi::IdUndirectedGraph::InV ( int  V  )  bool cosi::IdUndirectedGraph::InE ( int  i, int  j   ) bool cosi::IdUndirectedGraph::InE ( Edge  pE  )  void cosi::IdUndirectedGraph::AddEdge ( int  i, int  j   ) Reimplemented in cosi::U_CommunicationStructure< L >, and cosi::U_CommunicationStructure< cosi::Label_1 >. void cosi::IdUndirectedGraph::AddEdge ( Edge  pE  )  Reimplemented in cosi::U_CommunicationStructure< L >, and cosi::U_CommunicationStructure< cosi::Label_1 >. void cosi::IdUndirectedGraph::DeleteEdge ( int  i, int  j   ) Reimplemented in cosi::U_CommunicationStructure< L >, and cosi::U_CommunicationStructure< cosi::Label_1 >. void cosi::IdUndirectedGraph::DeleteEdge ( Edge  pE  )  Reimplemented in cosi::U_CommunicationStructure< L >, and cosi::U_CommunicationStructure< cosi::Label_1 >. int cosi::IdUndirectedGraph::Order (  )  int cosi::IdUndirectedGraph::Size (  )  IdUndirectedGraph::list_iterator cosi::IdUndirectedGraph::adj_begin ( int  V  )  Returns the begin iterator to the list of vertices connected to V. IdUndirectedGraph::list_iterator cosi::IdUndirectedGraph::adj_end ( int  V  )  Returns the end iterator to the list of vertices connected to V. IdUndirectedGraph::v_iterator cosi::IdUndirectedGraph::v_begin (  )  Returns the begin iterator to the set of vertexes. IdUndirectedGraph::v_iterator cosi::IdUndirectedGraph::v_end (  )  Returns the end iterator to the set of vertexes. std::string cosi::IdUndirectedGraph::GetName (  )  const Returns the name of the graph. void cosi::IdUndirectedGraph::SetName ( std::string  pName  )  Sets the name of the graph. void cosi::IdUndirectedGraph::SetName ( int  V, std::string  pName   ) Sets the name of a vertex. void cosi::IdUndirectedGraph::SetName ( int  U, int  V, std::string  pName   ) Sets the name of an edge. void cosi::IdUndirectedGraph::SetName ( Edge  pE, std::string  pName   ) std::string cosi::IdUndirectedGraph::GetName ( int  V  )  Get the name of the a vertex. std::string cosi::IdUndirectedGraph::GetName ( int  U, int  V   ) Get the name of the an edge. std::string cosi::IdUndirectedGraph::GetName ( Edge  pE  )  std::string cosi::IdUndirectedGraph::Print (  )  [virtual] std::string cosi::IdUndirectedGraph::PrintNode ( int  V  )  [virtual] Reimplemented in cosi::U_CommunicationStructure< L >, and cosi::U_CommunicationStructure< cosi::Label_1 >. std::string cosi::IdUndirectedGraph::PrintEdge ( int  U, int  V   ) [virtual] Reimplemented in cosi::U_CommunicationStructure< L >, and cosi::U_CommunicationStructure< cosi::Label_1 >. std::string cosi::IdUndirectedGraph::PrintEdge ( Edge  pE  )  [virtual] Reimplemented in cosi::U_CommunicationStructure< L >, and cosi::U_CommunicationStructure< cosi::Label_1 >. Member Data Documentation std::map< int , std::list<int> > cosi::IdUndirectedGraph::mAdjList [private] Adj List. std::set<int> cosi::IdUndirectedGraph::mV [private] int cosi::IdUndirectedGraph::mSize [private] Number of edges in the graph. string cosi::IdUndirectedGraph::mName [private] Name of the graph. std::map< int , std::string > cosi::IdUndirectedGraph::mNodeName [private] std::map< std::pair<int,int> , std::string > cosi::IdUndirectedGraph::mEdgeName [private] int cosi::IdUndirectedGraph::mLastId [private] The documentation for this class was generated from the following files: core/IdUndirectedGraph.h core/IdUndirectedGraph.cpp

Contact

©2002-2018 U.C. Regents