Closed richelbilderbeek closed 6 years ago
I suggest to move these algorithms to Book 2:
3.4 Create a direct-neighbour subgraph from a vertex descriptor
3.5 Create a direct-neighbour subgraph from a vertex descriptor including inward edges
3.6 Creating all direct-neighbour subgraphs from a graph with-out properties
[note: isomorphism should be in Basics]
3.8 Count the number of connected components in an directed graph
3.9 Count the number of connected components in an undi-rected graph
3.10 Count the number of levels in an undirected graph . .
@mywtfmp3 : would you agree taking care of these functions?
(Note: I added two triangles before the chapter names in the Table of Content)
I like 3.8, 3.9 and 3.10
in Book 2, because they make direct use of algorithms from boost graph library.
I am not so sure about 3.4, 3.5 and 3.6
. Maybe I haven't find the right algorithm yet.
I am can well imagine my algorithms can be improved. OTOH: the tests are already fine.
Done.
As @mywtfmp3 will create the sequel of this simple tutorial, link and refer to it.