mmcs-ruby / visual_graphs Goto Github PK

The result must be a new graph with corresponding base presenting the minimum spanning forest of a given weighted undirected graph

Add grpah injection from files to graph class

• Determine which items are needed
• Do it

Implement type conversion. The result of func must be new graph of appropriate class

Take it.

In output we receive picture of the graph including all the vertices and edges.
Must include option to choose which properies shall be displayed

Implement type conversion. The result of func must be new graph of appropriate class

Must include:

• name property
• weight property
• color property (for further picture output)
• initialization. Requires weight property, name is optional (default is empty string), color is optional (default is black)
• nice output into output stream
• necessary tests
• necessary docs

The result must be a new graph with corresponding base presenting the minimum spanning forest of a given weighted undirected graph

The result must be a new graph with corresponding base presenting the minimum spanning tree for a given weighted undirected graph

In output we receive picture of the graph including all the vertices and edges.
Must include option to choose which properies shall be displayed

Determine the number of algorithms and make a list of them. Put it in README.md

The result must be a new graph with corresponding base presenting the minimum spanning tree for a given weighted undirected graph

• ==
• ===
• eql?
• equal?
  use https://stackoverflow.com/questions/7156955/whats-the-difference-between-equal-eql-and if you do not know the difference

Make sure class include:

• initialization by json import
• initialization by taking matrix as parameter
• vertices array getter
• edges array getter
• inserting a new vertex to existing graph
• inserting a new edge to existing graph
• output to standard output stream (useful for graph mutation debug)
• output to json file (useful for graph mutation debug)
• necessary tests
• necessary docs

depth-first traversal with some action for each vertex

take it

depth-first traversal with some action for each vertex

Make sure class include:

• initialization by json import
• initialization by taking adjacency list as parameter (in hash presentation)
• vertices array getter
• edges array getter
• inserting a new vertex to existing graph
• inserting a new edge to existing graph
• output to standard output stream (useful for graph mutation debug)
• output to json file (useful for graph mutation debug)
• necessary tests
• necessary docs

• Update Gemspec and Gemfile 💎
• Add Linux as a platform 🐧
• Setup Build Action on Github 🛠️
• Add integration with CodeClimate ⛰️
• Add badges 🏅
• Make sure build passes and metrics work ✨

take it

Must include:

• name property, setter/getter
• value property
• color property (for further picture output)
• initialization. Requires value property, name is optional (default is empty string), color is optional (default is black)
• nice output into output stream
• necessary tests
• necessary docs