People is represented in the Graph by Nodes or Vertices (the vertex should consist of name of the person) Relationships is represented in the Graph by edges or arcs The project should have at least two class with following methods : addNode add vertices to graphs(New person in the Graph Net ) removeNode removes vertices to graphs(remove person from the graph Net) addEdge adds connections or paths between vertices in graphs(make new relationship between two persons in the graph ) removeEdge removes connection or paths between vertices in graphs (remove the relationship between two persons in the graph ) contains check if a graph contains a certain value hasEdge checks if a connection or path exists between any two vertices in a graph The output has to display a menu of choices. Then the user can select which operation want to perform. Also, you can use the method System.exit(0); to exit the program. The menu of choices will be: Add person into the social Graph. Remove a person from the Social Graph. Remove the Relationship between two persons. Update the Relationship between two persons Display the entire social Graph. Exit the program
People is represented in the Graph by Nodes or Vertices (the vertex should consist of name of the person) Relationships is represented in the Graph by edges or arcs The project should have at least two class with following methods : addNode add vertices to graphs(New person in the Graph Net ) removeNode removes vertices to graphs(remove person from the graph Net) addEdge adds connections or paths between vertices in graphs(make new relationship between two persons in the graph ) removeEdge removes connection or paths between vertices in graphs (remove the relationship between two persons in the graph ) contains check if a graph contains a certain value hasEdge checks if a connection or path exists between any two vertices in a graph The output has to display a menu of choices. Then the user can select which operation want to perform. Also, you can use the method System.exit(0); to exit the program. The menu of choices will be: Add person into the social Graph. Remove a person from the Social Graph. Remove the Relationship between two persons. Update the Relationship between two persons Display the entire social Graph. Exit the program
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
People is represented in the Graph by Nodes or Vertices (the vertex should consist of name of the person)
Relationships is represented in the Graph by edges or arcs
The project should have at least two class with following methods :
addNode add vertices to graphs(New person in the Graph Net )
removeNode removes vertices to graphs(remove person from the graph Net)
addEdge adds connections or paths between vertices in graphs(make new relationship between two persons in the graph )
removeEdge removes connection or paths between vertices in graphs (remove the relationship between two persons in the graph )
contains check if a graph contains a certain value
hasEdge checks if a connection or path exists between any two vertices in a graph
The output has to display a menu of choices. Then the user can select which operation want to perform. Also, you can use the method System.exit(0); to exit the program . The menu of choices will be:
Add person into the social Graph.
Remove a person from the Social Graph.
Remove the Relationship between two persons.
Update the Relationship between two persons
Display the entire social Graph.
Exit the program
Transcribed Image Text:The output has to display a menu of choices. Then the user can select which
operation want to perform. Also, you can use the method System.exit(0); to exit the
program. The menu of choices will be:
1) Add person into the social Graph.
2) Remove a person from the Social Graph.
3) Remove the Relationship between two persons.
4) Update the Relationship between two persons
5) Display the entire social Graph.
6) Exit the program.
Transcribed Image Text:People is represented in the Graph by Nodes or Vertices (the
vertex should consist of name of the person)
Relationships is represented in the Graph by edges or arcs
The project should have at least two class with following methods :
addNode add vertices to graphs(New person in the Graph Net )
removeNode removes vertices to graphs(remove person from the
graph Net)
addEdge adds connections or paths between vertices in
graphs(make new relationship between two persons in the graph )
removeEdge removes connection or paths between vertices in
graphs (remove the relationship between two persons in the
graph )
contains check if a graph contains a certain value
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 2 images
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question
I need a java code version the same question if possiable PLEASE!
Solution
by Bartleby ExpertRecommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY