價格：免費
更新日期：2017-11-16
檔案大小：2.3M
目前版本：4.0
版本需求：Android 4.2 以上版本
官方網站：http://www.kamilbolka.com
Email：doyoutech@gmail.com
KGraphs is an easy way of learning how graphs, relations, and algorithms work together in order to find spanning trees, shortest path, Eulerian circuit/path, Hamiltonian circuit/path, reflexive relations, symmetric relations, transitive relations and much more.
KEY FEATURES
Undirected Graph:
- Undirected Relations
- Simple Graph
- Connected
- Kn
- Cn
- Cyclic Graph
- Multigraph
- Eulerian Circuit
- Eulerian Path
- Hamiltonian Circuit
- Hamiltonian Path
- Tree Graph
Weighted Undirected Graph:
- Includes everything from Undirected Graph
- Dijkstra's algorithm for finding the shortest path
- Kruskal's method for finding minimum spanning three
Directed Graph:
- Directed relations
- Reflexive relation and closure
- Symmetric relation and closure
- AntiSymmetric relation
- Transitive relation and closure
- Order Relation
- Hasse Diagram
- Topological sort
- Connected relation
- Multigraph
- Cycle
Developer:
LinkedIn: Kamil Bolka (https://goo.gl/BgUESH)
Twitter: @kamilbolka
Website: www.kamilbolka.com
Logo Artist:
Twitter: @JengoF_Art
