Discrete

John Golden, 2014年11月20日

For counting, graphs, trees, etc.


  • 1. Simple Graphs with Four Labeled Nodes
  • 2. Discrete Command
  • 3. Euler Graph
  • 4. Generate Graph
  • 5. Discrete Graph and Adjacency Matrix
  • 6. Minimum Spanning Tree Practice
  • 7. Handshakes
  • 8. tesseract hamiltonian
  • 9. Icosian Game
  • 10. Graph 1
  • 11. Graph Network Generator
  • 12. Discrete Graph and Adjacency Matrix
  • 13. Adjacency Matrix to Graph
  • 14. Minimum Spanning Tree Generator and Calculator
  • 15. Havel Hakimi Algorithm
  • 16. tree-diagram
  • 17. algorithm of Kruskal

1.

Simple Graphs with Four Labeled Nodes

This shows all 64 graphs with 4 "labeled" nodes.
– Roy Wright

2.

–

3.

–

4.

–

5.

–

6.

–

7.

–

8.

–

9.

–

10.

–

11.

–

12.

–

13.

–

14.

–

15.

–

16.

–

17.

–

資訊