Ill check but in my build notable is a subitem of first notable

Le 7 févr. 2013 à 09:43, Jacques-Olivier Lachaud <notifications@github.com> a écrit :

> In src/DGtal/graph/doc/moduleGraphDefinitions.dox:
> 
> > +   matrix, outgoing edges per vertex. A rather comprehensive set of \b
> > +   finite graph concepts may for instance be found in the boost::graph
> > +   module.
> > +
> > +   Graphs in DGtal may be finite (like Object) or only locally finite
> > +   (like MetricAdjacency). Graphs in DGtal are undirected. Therefore,
> > +   they are two different concepts for graphs:
> > +
> > +   - locally finite graphs satisfy concept
> > +     CUndirectedSimpleLocalGraph. There is no way to iterate through
> > +     all vertices of that kind of graph (since they can be
> > +     infinite). Edges of this graph are given through an adjacency
> > +     list for each vertex.
> > +
> > +     - Notable models: MetricAdjacency
> > +     - Notable refinements: CAdjacency, CUndirectedSimpleGraph
> It is what I wish for. (notable xx are subitems of locallay finite graphs).
> 
> —
> Reply to this email directly or view it on GitHub.
>