Graphynx, graphs & algorithms
9.6 3
v1.13 by VILARIS
Price:$2.99
Editor's Review
Create weighted and unweighted graphs and run algorithms step by step. Learn graph theory interactively… much better than a book!.About Graphynx, graphs & algorithms
Graphynx, graphs & algorithms (Package Name: com.vilaris.graphynx) is developed by VILARIS and the latest version of Graphynx, graphs & algorithms 1.13 was updated on April 26, 2016. Graphynx, graphs & algorithms is in the category of Education. You can check all apps from the developer of Graphynx, graphs & algorithms and find 42 alternative apps to Graphynx, graphs & algorithms on Android. The current price of this app is $2.99. This app can be downloaded on 2.3 and up on APKFab or Google Play. All APK/XAPK files on APKFab.com are original and 100% safe with fast download.
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
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
Graphynx, graphs & algorithms Features
Related Videos
Graphynx, graphs & algorithms for Android
More Information
Package Name:
Update Date:
2016-04-26
Latest Version:
1.13
Need Update:
Requirements:
2.3 and up
Report:
Safe to Download
APKFab.com and the download link of this app are 100% safe. All download links of apps listed on APKFab.com are from Google Play Store or submitted by users. For the app from Google Play Store, APKFab.com won't modify it in any way. For the app submitted by users, APKFab.com will verify its APK signature safety before release it on our website.