concept graph framework in category algorithms

This is an excerpt from Manning's book Classic Computer Science Problems in Java.
1. Add support to the graph framework for removing edges and vertices.
2. Add support to the graph framework for directed graphs (digraphs).
3. Use this chapter’s graph framework to prove or disprove the classic Bridges of Königsberg problem, as described on Wikipedia: https://en.wikipedia.org/wiki/ Seven_Bridges_of_Königsberg.

This is an excerpt from Manning's book Classic Computer Science Problems in Python.
Add support to the graph framework for removing edges and vertices. Add support to the graph framework for directed graphs (digraphs). Use this chapter’s graph framework to prove or disprove the classic Bridges of Königsberg problem, as described on Wikipedia: https://en.wikipedia.org/wiki/Seven_Bridges_of_Königsberg.

This is an excerpt from Manning's book Classic Computer Science Problems in Swift: Essential techniques for practicing programmers.
Swift has been promoted as enabling a protocol-oriented style of programming (as opposed to the traditional object-oriented or functional paradigms).[3] Although the orthodoxy of this new paradigm is still being fleshed-out, what is clear is that it puts interfaces and composition ahead of inheritance. Whereas the class is the fundamental building block in the object-oriented paradigm, and the function is the fundamental building block in functional programming, the protocol is the fundamental building block in protocol-oriented programming. In that light, we will try building a graph framework in a protocol-first style.