home *** CD-ROM | disk | FTP | other *** search
/ Power-Programmierung / CD2.mdf / c / library / dos / diverses / leda / man / graph_mi.tex < prev    next >
Encoding:
Text File  |  1991-11-15  |  1.9 KB  |  52 lines
  1. \bigskip
  2. \bigskip
  3. {\magonebf 5.13 Miscellaneous}
  4. \bigskip
  5. {\bf 5.13.1 Some useful functions}
  6. \bigskip
  7.  
  8. \cleartabs
  9. \+$void$ complete\_graph($graph\&\ G,\ int\ n$) &\cr
  10. \+                           &creates a complete graph $G$ with $n$ nodes.\cr
  11. \+\cr
  12. \+$void$ random\_graph($graph\&\ G,\ int\ n,\ int\ m$)\cr
  13. \+                           &creates a random graph $G$ with $n$ nodes\cr
  14. \+                           &and $m$ edges.\cr
  15. \+\cr
  16. \+$void$ test\_graph($graph\&\ G$)
  17.                              &creates interactively a user defined graph $G$.\cr
  18. \+\cr
  19. \+$void$ test\_bigraph($graph\&\ G,\ nodelist\&\ A,\ nodelist\&\ B$)\cr
  20. \+                           &creates interactively a user defined bipartite\cr
  21. \+                           &graph $G$ with sides $A$ and $B$. All edges are\cr
  22. \+                           &directed from $A$ to $B$.\cr
  23. \+\cr
  24. \+$bool$ compute\_correspondence($graph\&\ G,\ edge\_array(edge)\&\ reversal$)\cr
  25. \+                           &computes for every edge $e = (v,w)$ in $G$ its\cr
  26. \+                           &reversal $reversal[e] = (w,v)$ in $G$ ( nil if\cr
  27. \+                           ¬ present). Returns true if every edge has a\cr
  28. \+                           &reversal and false otherwise.\cr
  29. \+\cr
  30. \+$void$ eliminate\_parallel\_edges($graph\&\ G$)\cr
  31. \+                           &removes all parallel edges from $G$.\cr
  32.  
  33.    
  34. \bigskip
  35. {\bf 5.13.2 Predefined parameterized types}
  36. \cleartabs
  37. \+\hskip 8truecm &\cr
  38. \+$list(node)$                  &$list(edge)$\cr
  39. \+\cr
  40. \+$node\_array(int)$            &$edge\_array(int)$\cr
  41. \+$node\_array(bool)$           &$edge\_array(bool)$\cr
  42. \+$node\_array(real)$           &$edge\_array(real)$\cr
  43. \+$node\_array(node)$           &$edge\_array(node)$\cr
  44. \+$node\_array(edge)$           &$edge\_array(edge)$\cr
  45. \+\cr
  46. \+$node\_matrix(int)$\cr
  47. \+$node\_matrix(bool)$\cr
  48. \+$node\_matrix(real)$\cr
  49.  
  50. \vfill\eject
  51.  
  52.