A Software System for Visual Processing of Graph Data
Institute of Information Technologies, 1113 Sofia
There exist a large number of combinatorial problems defined on graphs (or networks). Many efficient algorithms for both directed and undirected graphs problems solving are known and all of them need input of the graph structure data. The current paper describes a software system for visual processing of graph data for the purposes of combinatorial graph problems solving. It can be used as a tool for teaching or learning the work of the combinatorial graph algorithms and for solving of practical graph problems.
Keywords: software system, Java-application, graph data, visual editing, shortest paths, Dijkstra’s algorithm.