I have a graph with about 6000 nodes (pedigree). The program should determine all ways between two given nodes (relationship). Depending on the position of the start and destination nodes, the number of paths to be searched can be very large. Now I want to monitor the free heap so that I can adjust the search strategy depending on the size still available. How can I determine the size of the free heap?
Translated with www.DeepL.com/Translator (free version)