$1.99
View on iTunes
Category: Education
Released: 29 Aug 2014
Published: 27 Apr 2024
Latest version: 1.7
Size: 30.88 MB
Seller: VILAR INGENIERIA DE SOFTWARE S.L.
© VILAR INGENIERIA DE SOFTWARE S.L.
LANGUAGES:
English
COMPATIBILITY:
iPad23G
iPad2Wifi
iPadFourthGen
iPadFourthGen4G
iPadMini
iPadMini4G
iPadThirdGen
iPadThirdGen4G
iPhone-3GS
iPhone4
iPhone4S
iPhone5
iPhone5c
iPhone5s
iPodTouchFifthGen
iPodTouchourthGen
Released: 29 Aug 2014
Published: 27 Apr 2024
Latest version: 1.7
Size: 30.88 MB
Seller: VILAR INGENIERIA DE SOFTWARE S.L.
© VILAR INGENIERIA DE SOFTWARE S.L.
LANGUAGES:
English
COMPATIBILITY:
iPad23G
iPad2Wifi
iPadFourthGen
iPadFourthGen4G
iPadMini
iPadMini4G
iPadThirdGen
iPadThirdGen4G
iPhone-3GS
iPhone4
iPhone4S
iPhone5
iPhone5c
iPhone5s
iPodTouchFifthGen
iPodTouchourthGen
Graphynx
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)
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
- Save your graphs and load them later
- Graph statistics (number of nodes, number of edges, node degrees, Eulerian, semi-Eulerian, connected components)
- 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)
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
- Save your graphs and load them later
- Graph statistics (number of nodes, number of edges, node degrees, Eulerian, semi-Eulerian, connected components)
- Pinch to zoom
Supported languages:
- English
- Spanish
What's new in Version 1.7
- Added full multi-edges support
- Added snap to grid option
- New special graphs: Star, Grötzsch, Platonic (Tetrahedron, Cube, Octahedron, Icosahedron, Dodecahedron)
- Improved edge selection
- Several minor bug fixes
- Added snap to grid option
- New special graphs: Star, Grötzsch, Platonic (Tetrahedron, Cube, Octahedron, Icosahedron, Dodecahedron)
- Improved edge selection
- Several minor bug fixes
Download
Version | Uploader | Link |
---|---|---|
1.7 | alienopo-ICPDA | Link 1 |
1.7 | alienopo-ICPDA | Link 2 |
1.7 | alienopo-ICPDA | Link 3 |
1.6 | alienopo-ICPDA/alienopo | Link 4 |
1.6 | alienopo-ICPDA/alienopo | Link 5 |
1.6 | alienopo-ICPDA/alienopo | Link 6 |
1.5 | AppCakeBot/AppCakeBot | Link 7 |
1.5 | AppCakeBot/AppCakeBot | Link 8 |
1.5 | alienopo-ICPDA/alienopo-ICPDA | Link 9 |
1.5 | alienopo-ICPDA/alienopo-ICPDA | Link 10 |
1.5 | alienopo-ICPDA/alienopo-ICPDA | Link 11 |
1.4 | alienopo-ICPDA/alienopo-ICPDA | Link 12 |
1.4 | alienopo-ICPDA/alienopo-ICPDA | Link 13 |
1.3 | AppCakeBot/AppCakeBot | Link 14 |
1.3 | alienopo - ICPDA/alienopo | Link 15 |
1.3 | alienopo - ICPDA/alienopo | Link 16 |
1.3 | alienopo - ICPDA/alienopo | Link 17 |