Boost logo

Boost Users :

From: Abhishek V (abhishek.v_at_[hidden])
Date: 2007-09-06 07:29:42


Hi

Currently i m creating adjacency_list in this format .
typedef adjacency_list < vecS, vecS, undirectedS, property <
vertex_name_t,
    std::string >, property < edge_name_t, std::string > > Graph;
  Graph g;

Now user will decide whether the graph is directed or undirected and
accordingly i will create
 the adjancency_list. undirectedS or directedS . Is there any
representation which can help
me out in this case or suggest me a way by which this can be done..

Thanks
Abhishek Vyas
Tata Consultancy Services
Mailto: abhishek.v_at_[hidden]
Website: http://www.tcs.com
____________________________________________
Experience certainty. IT Services
                        Business Solutions
                        Outsourcing
____________________________________________
=====-----=====-----=====
Notice: The information contained in this e-mail
message and/or attachments to it may contain
confidential or privileged information. If you are
not the intended recipient, any dissemination, use,
review, distribution, printing or copying of the
information contained in this e-mail message
and/or attachments to it are strictly prohibited. If
you have received this communication in error,
please notify us by reply e-mail or telephone and
immediately and permanently delete the message
and any attachments. Thank you



Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net