Write python code. Use the Graphs - a quick review notebook and complete the Graph object implementation
Budget: $10 – $30 USD
https://colab.research.google.com/drive/1W9YMAwv-pJucNpne2UdZQAxf7MN3t7V1?usp=sharing#scrollTo=qfi6Bab292LQ
Visit the google collaboratory link above to get a better understanding of what needs to be done.
Use the Graphs - a quick review notebook and complete the Graph object implementation as follows:
Write a function called edge_exists that returns true if there is an edge between two vertices in the graph object or false otherwise.
In an undirected graph, the degree of a vertex is the number of edges incident on it. Write a function called degree that returns the degree of each vertex in the graph object.
In a directed graph, the out-degree of a vertex is the number of edges that leave it. The in-degree is the number of edges that arrive at it. Write a function called degrees that returns the out- and in-degree of each vertex in the graph object.
Requirements: your code must be neat and documented with comments. Each function must have a docstring. Functions must have the names specified above. This enables automagic testing of your code. In these specifications "return" does not mean "print". Methods that are specified to return something should never print anything. Please let me know if you'd like to use Java instead of Python and I'll provide you with the necessary starter code.
Visit the google collaboratory link above to get a better understanding of what needs to be done.
Use the Graphs - a quick review notebook and complete the Graph object implementation as follows:
Write a function called edge_exists that returns true if there is an edge between two vertices in the graph object or false otherwise.
In an undirected graph, the degree of a vertex is the number of edges incident on it. Write a function called degree that returns the degree of each vertex in the graph object.
In a directed graph, the out-degree of a vertex is the number of edges that leave it. The in-degree is the number of edges that arrive at it. Write a function called degrees that returns the out- and in-degree of each vertex in the graph object.
Requirements: your code must be neat and documented with comments. Each function must have a docstring. Functions must have the names specified above. This enables automagic testing of your code. In these specifications "return" does not mean "print". Methods that are specified to return something should never print anything. Please let me know if you'd like to use Java instead of Python and I'll provide you with the necessary starter code.