Rework and fix the implementation of MinMeanCycle (#179)

- Fix the handling of the cycle means.
- Many implementation improvements:
- More efficient data storage for the strongly connected
components.
- Better handling of BFS queues.
- Merge consecutive BFS searches (perform two BFS searches
instead of three).

This version is about two times faster on average and an order of
magnitude faster if there are a lot of strongly connected components.

 INCLUDE_DIRECTORIES(

   ${PROJECT_SOURCE_DIR}

   ${PROJECT_BINARY_DIR}

 )

 LINK_DIRECTORIES(

   ${PROJECT_BINARY_DIR}/lemon

 )

 SET(DEMOS

   arg_parser_demo

   graph_to_eps_demo

   lgf_demo

 )

 FOREACH(DEMO_NAME ${DEMOS})

   ADD_EXECUTABLE(${DEMO_NAME} ${DEMO_NAME}.cc)

   TARGET_LINK_LIBRARIES(${DEMO_NAME} lemon)

 ENDFOREACH()