example.gml 1.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
  1. # generated with gcctree2gml
  2. graph [
  3. directed 1
  4. node [ id 72 label "search()
  5. ENTRY" ]
  6. node [ id 73 label "search()
  7. EXIT" ]
  8. node [ id 3 label "<bb 2>: search()
  9. bbD.4175_2(D)->visitedD.4144 = 1;
  10. veD.4179_3 = bbD.4175_2(D)->succD.4149;
  11. if (veD.4179_3 != 0B)
  12. goto <bb 3>;
  13. else
  14. goto <bb 7>;
  15. " ]
  16. node [ id 4 label "<bb 3>: search()
  17. " ]
  18. node [ id 5 label "<bb 7>: search()
  19. count.10D.5607_8 = countD.4173;
  20. bbD.4175_2(D)->dfs_orderD.4145 = count.10D.5607_8;
  21. count.11D.5608_10 = count.10D.5607_8 + -1;
  22. countD.4173 = count.11D.5608_10;
  23. return;
  24. " ]
  25. node [ id 6 label "<bb 4>: search()
  26. eD.4180_4 = veD.4179_9->edgeD.4138;
  27. succ_bbD.4178_5 = eD.4180_4->targetD.4135;
  28. D.5604_6 = succ_bbD.4178_5->visitedD.4144;
  29. if (D.5604_6 == 0)
  30. goto <bb 5>;
  31. else
  32. goto <bb 6>;
  33. " ]
  34. node [ id 7 label "<bb 6>: search()
  35. veD.4179_7 = veD.4179_9->nextD.4139;
  36. if (veD.4179_7 != 0B)
  37. goto <bb 4>;
  38. else
  39. goto <bb 7>;
  40. " ]
  41. node [ id 8 label "<bb 5>: search()
  42. eD.4180_4->typeD.4133 = 1;
  43. searchD.4176 (succ_bbD.4178_5);
  44. " ]
  45. edge [ source 72 target 3 ]
  46. edge [ source 3 target 4 ]
  47. edge [ source 3 target 5 ]
  48. edge [ source 4 target 6 ]
  49. edge [ source 7 target 6 fill "#0000ff" ]
  50. edge [ source 6 target 8 ]
  51. edge [ source 6 target 7 ]
  52. edge [ source 8 target 7 ]
  53. edge [ source 7 target 5 ]
  54. edge [ source 5 target 73 ]
  55. ]