riccardolocci / nfo Goto Github PK

For debug purposes , it could be useful to add a random generator

Implement a force layout to rearrange nodes in a human friendly way:
https://observablehq.com/@d3/force-directed-graph?collection=@d3/d3-force

Sometimes some actions take a long time, so the interface could freeze. There must be a loading icon that shows that the application is loading

Find a library that draws graphs and run some test to implement the algorithms

The info box should contain a log of all the activities to understand what is being done.
Moreover, it should be possible to go to a specific moment of the execution by clicking on the log line.

At the moment you only can distinguish the role of each element (arc, node) without knowing the role associated to a color

Change the current RESET button, to a NEW GRAPH button.
Add a new RESET that removes all the customizations but keeps the graph

Add component that allows upload/drop of a file describing a graph

Sometimes, with relatively big graphs ( |N| ~ 50 ), if you click the "Next" button too early the application would run into an error caused by uncompleted previous operations (incosistent state)

The interface is developed and tested on a 27" monitor. It is not usable on a laptop.
The styles need refactoring in this sense

It would be useful to allow the user to choose the colors to be used in the graphical interface

At the moment the objective function only takes into account only in an edge is used or not, not how many times

Add a button to go back to no file state and resume drop view

Design basic SPP component

It could be useful to be able to download a file used (perhaps randomly generated) in the app

When there are a lot of nodes, the table containing the paths and the two select elements get too large and take all the page in height

To improve debugging, it should be possible to click on buttons which will load sample graphs

The current behaviour is to select a single target.
Since Dijkstra allows to reach all the other nodes, this should be the default.
Thus add the option to select one or many targets.

Convert the basic algorithm so that every step can be showed in the graph

Define the structure of files that describe graphs and examples

Design basic MFP component

Design basic MCFP component

The current algorithm implementation only allows for a single target to be reached, the extension would allow multiple targets to be reached

At the moment it is only possible to choose a single source for the algorithm, a complete implementation would allow multiple sources to a single destination

Add a Considerations paragraph to illustrate limits and usefulness of the project

Considerations:

• The project works well with at most 50 nodes/170 edges, when tested with 100 nodes/355 edges it was able to process the graph but with noticeable lag

Implement a basic algorithm for Shortest Path Problem and adapt the graph to the result