Graphynx, graphs & algorithms
9.6 3
v1.13 von VILARIS
Preis:$2.99
Bewertung der Redaktion
Create weighted and unweighted graphs and run algorithms step by step. Learn graph theory interactively… much better than a book!.Über Graphynx, graphs & algorithms
Graphynx, graphs & algorithms (Paketname: com.vilaris.graphynx) wird von VILARIS entwickelt und die neueste Version von Graphynx, graphs & algorithms 1.13 wurde am 26. April 2016 aktualisiert. Graphynx, graphs & algorithms liegt in der Kategorie von Lernen. Sie können alle Apps von dem Entwickler der Graphynx, graphs & algorithms durchsuchen und 42 alternative Apps zu Graphynx, graphs & algorithms auf Android finden. Der aktuelle Preis der APP ist $2.99. Diese App kann auf 2.3 and up auf APKFab oder Google Play heruntergeladen werden. Alle APK/XAPK Dateien auf APKFab.com sind original und 100% sicher, schnell herunterzuladen.
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
Mehr lesen
Graphynx, graphs & algorithms Besonderheiten
Ähnliche Videos
Graphynx, graphs & algorithms for Android
Mehr Information
Paketnamen:
Aktualisierungsdatum:
2016-04-26
Letzte Version:
1.13
Update brauchen:
Anforderungen:
2.3 and up
Meldung:
Sich herunterladen
APKFab.com und der Download-Link dieser App sind 100% sicher. Alle auf APKFab.com aufgelisteten Download-Links für Apps stammen aus Google Play Store oder werden von Benutzern eingereicht. Bei der App aus Google Play Store wird sie von APKFab.com in keiner Weise geändert. Bei der von Benutzern eingereichten App überprüft APKFab.com die Sicherheit der APK-Signatur, bevor sie auf unserer Webseite veröffentlicht wird.