Changes between Version 1 and Version 2 of soc/2007/UserFriendlyGraphDesignThree


Ignore:
Timestamp:
May 18, 2007, 12:10:42 PM (15 years ago)
Author:
Andrew Sutton
Comment:

--

Legend:

Unmodified
Added
Removed
Modified

  • soc/2007/UserFriendlyGraphDesignThree

    v1 v2  
    5656  template <class VP, class EP, class GP>
    5757  inline std::pair<undirected_graph<VP,EP,GP>::edge_descriptor, bool>
    58   add_edge(undirected_graph<VP,EP,GP> &g
    59            undirected_graph<VP,EP,GP>::vertex_descriptor u,
    60            undirected_graph<VP,EP,GP>::vertex_desrciptor v)
     58  add_edge(undirected_graph<VP,EP,GP>::vertex_descriptor u,
     59           undirected_graph<VP,EP,GP>::vertex_desrciptor v,
     60           undirected_graph<VP,EP,GP> &g)
    6161  {
    6262    return g.add_edge(u, v);
    … …  
    7474 3. and the guarantees type and performance required by the orignal Boost.Graph concepts.
    7575
    76 It might also be worth noticing the re-ordering of parameters to the `add_edge()` method. This aligns with the more convential style of putting the target object fist in the parameter list.
    77 
    7876== Remarks ==
    7977I'm actually very fond of this approach since it reduces the interface so much. However, this does leave questions about the `directed_graph`. Specifically, should its directional selection be `directedS` or `bidirectionalS`? My best guess is the latter since it provides more functionality at the expense of space efficiency, but it also makes it more applicable to a wider range of problems.