Subgraph matching application: partial solutions and final result.

[ciccio42]

Hello everyone.
I have a question about the Subgraph Matching Application, especially how the partial solutions are handled.
More specifically, I run the algorithm on a query graph and data graph such that multiple solutions exist.
However, I had trouble understanding the meaning of the information written in the "result" array.
Moreover, I wonder how I can retrieve the matches found.

I really appreciate any help you can provide.

[jowens]

I'm marking subgraph-matching issues that appear to be possibly be helpful:

#1034
#833
#804
#797
#656

@Laurawly is the expert here (and the author) but has graduated. @neoblizz and @crozhon might be able to offer comments on this?

[crozhon]

https://github.com/gunrock/gunrock/blob/master/gunrock/app/sm/sm_test.cuh

You can take a look at the sm_test and sm_app files to see what result is being printed.

gunrock/gunrock/app/sm/sm_app.cuh

Line 75 in 9479665

for (int run_num = 0; run_num < num_runs; ++run_num) {

It looks like the list_subgraphs variable might contain the resulting matches that you're looking for. One comment says,

    * @brief Copy result distancess computed on GPUs back to host-side arrays.
   * @param[out] count_subgraphs Host/Device array to store subgraph counts.
   * @param[out] list_subgraphs  **Host/Device array to store subgraph combinations.**
   * @param[in]  target where the results are computed
   * @param[in]  device where the results are stored
   * \return     cudaError_t Error message(s), if any
   */
  cudaError_t Extract(unsigned long *count_subgraphs,
                      unsigned long **list_subgraphs

So maybelist_subgraphs has what you're looking for?