KGraphs

KGraphs est arrivé - êtes-vous prêt à apprendre relation et de nombreux algorithmes de graphique?

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