Graphynx, graphs & algorithms
9.6 3
v1.13 by VILARIS
價格:$2.99
編輯評論
Create weighted and unweighted graphs and run algorithms step by step. Learn graph theory interactively… much better than a book!.關於 Graphynx, graphs & algorithms
Graphynx, graphs & algorithms（包名：com.vilaris.graphynx）開發者是VILARIS，Graphynx, graphs & algorithms的最新版本1.13更新時間為2016年04月26日。Graphynx, graphs & algorithms的分類是教育。您可以查看Graphynx, graphs & algorithms的開發者下的所有應用並找到Graphynx, graphs & algorithms在安卓上的42個相似應用。目前該應用價格為$2.99。該應用可以從APKFab或Google Play下載到2.3 and up。APKFab.com的所有APK/XAPK文檔都是原始文檔並且100%安全下載的資源。
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
查看更多
Graphynx, graphs & algorithms 資訊
相關視頻
Graphynx, graphs & algorithms for Android
更多資訊
更新日期:
2016-04-26
最新版本:
1.13
請求更新:
系統要求:
2.3 and up
舉報:
安全下載
APKFab.com和該應用的下載連結是100%安全的。APKFab.com上列出的所有應用下載連結均來自Google Play Store或由用戶提交。對於來自Google Play商店的應用，APKFab.com不會對其進行任何形式的修改。對於用戶提交的應用，APKFab.com會在網站上發佈之前驗證其APK簽名的安全性。