classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view



I have a use for trees. In other words, directed acyclic graphs where
each vertex is connected by at most one edge. Are there any existing
classes that enforce this invariant in jgrapht? I could presumably
override an existing DAG implementation, but I'd rather not have to do
that if one already exists. I've had a look through the javadocs and
nothing is leaping out at me.


What NetFlow Analyzer can do for you? Monitors network bandwidth and traffic
patterns at an interface-level. Reveals which users, apps, and protocols are
consuming the most bandwidth. Provides multi-vendor support for NetFlow,
J-Flow, sFlow and other flows. Make informed decisions using capacity planning
jgrapht-users mailing list
[hidden email]