Interactive graph editing in Qt.
Interactive graph editing in Qt.
A set of C++/Qt visual graph assignments covering graph editing, traversals, topological ordering, spanning trees, shortest routes and network-flow algorithms.
*File metrics count tracked files after excluding common generated build folders. The project status is an editable draft classification.
Capabilities evidenced by project documentation and source structure; some behaviours require platform configuration.
Interactive graph editing in Qt.
BFS/DFS and topological ordering.
Spanning-tree, shortest-path and maximum-flow exercises.
Technical architecture drawn from the repository and supplied documentation.
The project uses C++, Qt 6, Graph Theory as its documented technical foundation.
The source tree and supplied README describe the primary modules; individual files and runtime behaviour may vary by platform.
QT-PROJECTS describes six graphical algorithm demos with distinct graph types and output interpretations.
Graph drawing, matrix BFS and Dijkstra on a scalable Luxembourg map focus on route finding and graph exploration. Dijkstra highlights the selected path and writes used edges to a file.
The other experiments include DFS-based topological operations, connected components, Prim/Kruskal/Borůvka spanning trees and Ford–Fulkerson maximum flow with residual-network views.
Documentation: GitHub repository / project specification. The content describes documented behaviour or plans; deployment readiness is not inferred.
Graph node creation from the sixth Qt exercise
void Graph::addNode(const QPoint& pos) {
nodes.push_back(new Node(nodes.size(), pos));
}
Edge* Graph::addEdge(Node* first, Node* second,
bool isOriented, int cost) {
for (auto edge : edges) {
if (edge->getFirst() == first && edge->getSecond() == second)
return edge;
}
Edge* newEdge = new Edge(first, second, cost);
edges.push_back(newEdge);
return newEdge;
}
An edge list is projected into a weighted matrix for file export.
std::vector<std::vector<int>> matrix(nodes.size(), std::vector<int>(nodes.size(), 0));
for (auto& edge : edges) {
int first = edge->getFirst()->getValue();
int second = edge->getSecond()->getValue();
matrix[first][second] = edge->getCost();
if (!isGraphOriented()) matrix[second][first] = edge->getCost();
}
Screenshots from supplied documentation and repository media. Missing visuals remain placeholders rather than invented screens.
To fill this space, add an approved screenshot with the exact filename shown below. The site currently displays a neutral placeholder.
assets/img/projects/qt-graph-algorithms/screenshot-01.webp
Technology overview: C++, Qt 6, Graph Theory. The list reflects documented tools, dependencies and proposed components; for planned projects it does not prove implementation.
File types identified: 25 .cpp, 19 .h, 6 .ui
Explore the public repository, source code and project documentation on GitHub.