FAQ: Graphs: Java - Graph Review

This community-built FAQ covers the “Graph Review” exercise from the lesson “Graphs: Java”.

Paths and Courses
This exercise can be found in the following Codecademy content:

Pass the Technical Interview with Java

FAQs on the exercise Graph Review

There are currently no frequently asked questions associated with this exercise – that’s where you come in! You can contribute to this section by offering your own questions, answers, or clarifications on this exercise. Ask or answer a question by clicking reply (reply) below.

If you’ve had an “aha” moment about the concepts, formatting, syntax, or anything else with this exercise, consider sharing those insights! Teaching others and answering their questions is one of the best ways to learn and stay sharp.

Join the Discussion. Help a fellow learner on their journey.

Ask or answer a question about this exercise by clicking reply (reply) below!
You can also find further discussion and get answers to your questions over in Language Help.

Agree with a comment or answer? Like (like) to up-vote the contribution!

Need broader help or resources? Head to Language Help and Tips and Resources. If you are wanting feedback or inspiration for a project, check out Projects.

Looking for motivation to keep learning? Join our wider discussions in Community

Learn more about how to use this guide.

Found a bug? Report it online, or post in Bug Reporting

Have a question about your account or billing? Reach out to our customer support team!

None of the above? Find out where to ask other questions here!

In question 4, I noticed that the .removeVertex method for a Graph object removes the vertex from the list of vertices,
but it does not remove the edges that go to the removed vertex.

Here’s a possible fix:

    public void removeVertex(Vertex vertex) {
        this.vertices.remove(vertex);
        for (Vertex otherVertex : this.vertices) {
            otherVertex.removeEdge(vertex);
        }
    }

But its not efficient, because it iterates through all vertices and the edges in the graph to find the ones that need to be removed.