simplegraph | memory Graph Database/Cache : learn | Database library

I am new to Julia and LightGraphs and I have been trying to find the most efficient way of detecting and removing self-loops. So far, the only way I have found is to iterate over all nodes in the Simplegraph, check whether it has a self-loop, and remove them. Is there any better way like using this combination in Python NetworkX: G.remove_edges_from(G.selfloop_edges())?

The way I am doing it right now:

I am trying to use depth first search starting from a particular vertex. For that I need to supply a visitor and a color map.

If I don't supply a starting vertex then I don't need to supply a color map either and everything works fine. However, I didn't find a signature that would accept a starting vertex without requiring a color map.

I use C++ 17 (Embarcadero C++ Builder) Here is the code:

I am using jgrapht in Java to work a network-based algorithm. I first read an adjacency list and then create jgrapht based graph. Now, given a subset of nodes called subNodes, I'd like to generate a sub graph. I am trying to use Subgraph class as shown at this link, however, I could not have it worked.

I have a connected graph A (level 0) and I want to populate the next level with graphs B,C,D... by iteratively removing one edge at a time in A. Here is how my code begins:

Let G=(V,E) be an undirected graph. I'd like to create an induced sub graph for a given subset of nodes U with JgraphT in Java.

Here is an adjacency list.

I have made a JAR from SimpleGraph which I want to use it in a separat project. In my own project I can see and use the direct classes of SimpleGraph like ExcelSystem etc. but can not use the underlying classes as Vertex etc. from Tinkerpop/Gremlin. Is there a way to include these into the JAR generation?