Find a number with minimum length which contains all the permutations of the given input
Given an undirected, random graph with 10 vertices find all the spanning trees. For the graphs are used adjacency matrixes.
-
Notifications
You must be signed in to change notification settings - Fork 0
dimitraka/discrete-maths
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Projects for discrete mathematics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published