Home > Apps > Education > Graphynx, graphs & algorithms
Graphynx, graphs & algorithms APK

Graphynx, graphs & algorithms

Size:20M

4.8

- 500+ Installs -

Promotional Video / Screenshot of Graphynx, graphs & algorithms

  • Graphynx, graphs & algorithmsScreenshot
  • Graphynx, graphs & algorithmsScreenshot 1
  • Graphynx, graphs & algorithmsScreenshot 2
  • Graphynx, graphs & algorithmsScreenshot 3
  • Graphynx, graphs & algorithmsScreenshot 4
  • Graphynx, graphs & algorithmsScreenshot 5
  • Graphynx, graphs & algorithmsScreenshot 6
  • Graphynx, graphs & algorithmsScreenshot 7
  • Graphynx, graphs & algorithmsScreenshot 8
  • Graphynx, graphs & algorithmsScreenshot 9
  • Graphynx, graphs & algorithmsScreenshot 10
  • Graphynx, graphs & algorithmsScreenshot 11
  • Graphynx, graphs & algorithmsScreenshot 12
  • Graphynx, graphs & algorithmsScreenshot 13
  • Graphynx, graphs & algorithmsScreenshot 14
  • Graphynx, graphs & algorithmsScreenshot 15

Description of Graphynx, graphs & algorithms

Create graphs (simple, weighted, directed and/or multigraphs) and run algorithms step by step. Learn graph theory interactively... much better than a book!

27 algorithms to choose from:

- Depth-first search (DFS)

- Breadth-first search (BFS)

- Count connected components (using BFS)

- Greedy coloring

- BFS coloring

- Dijkstra's algorithm (shortest path)

- A*/A-star (shortest path, Euclidean distance)

- DFS spanning tree

- BFS spanning tree

- Prim's algorithm (minimum spanning tree)

- Kruskal's algorithm (minimum spanning tree/forest)

- Bridge edges finding

- Articulation points/cut vertices finding

- Eulerian graph detection

- Semi-Eulerian graph detection

- Tarjan's algorithm for strongly connected components in directed graphs

- Tree detection

- Bipartite graph detection

- Complete graph detection

- Tree center (unweighted graph)

- Tree center (weighted graph)

- Tree radius

- Tree diameter

- Tree node eccentricity

- Tree centroid

- Complement (inverse) graph

- Fleury's algorithm (Eulerian cycles/paths in Eulerian and semi-Eulerian graphs)

...and more to come!

Create a graph manually, or use the special graph creation tool to create one of the following graphs:

- Cycle

- Star

- Wheel

- Complete

- Petersen

- Herschel

- Bipartite

- Grötzsch

- Platonic (Tetrahedron, Cube, Octahedron, Icosahedron, Dodecahedron)

- Grid

Features:

- Dozens of graph algorithms to choose from

- Step by step execution

- Create simple graphs and multigraphs

- Create weighted and unweighted graphs

- Create directed and undirected graphs

- Show/hide node degrees

- Loop edges & multi-edges support

- Custom node labels

- Custom node radius

- Custom edge weights

- Detailed execution log for all available algorithms

- Export graph as image to photo gallery

- Export graph as SVG vector file

- Save your graphs and load them later

- Graph statistics (number of nodes, number of edges, node degrees, Eulerian, semi-Eulerian, connected components, adjacency list)

- Pinch to zoom

Supported languages:

- English

- Spanish

Read more

More Information Of Graphynx, graphs & algorithms

lable: Education - Apps Current Version:1.13 Publish Date:2021-03-07 Developer:VILARIS

User Reviews

8.6
REVIEWS:7
5

What's new with you? Please tell everyone.

Post
Ravi Chandran 2018-07-25

5
Awesome....
Donald Bronson 2018-09-04

3
Fantastic! A feature I would love would be the ability to add images/long-form text to nodes and edges so that I can use it for \"crime board style\" link analysis.
Erik Schaftenaar 2015-02-07

3
Great app! Does everything it is supposed to, however I\'d like to label my edges (to model regex finite state automata), but didn\'t find how to.
Rob Canton 2014-10-23

2
Well Made and Very Useful
minxmu sint 2020-12-27

0
Amazing app! The main issue for me was that the buttons are too large and are aligned along the long edge of the screen. It would use space more effectively if gathered at the shorter edge(s), whether in album or portrait mode. Dark mode would also be very lovely.
Kabita Barua 2020-08-10

0
😂