jgrapht-users — JGraphT user list.

Re: [jgrapht-users] Confused with using DOT importer in the latest version

[Dimitrios M. <dim...@gm...>]

This feature is missing in the new importers. It will be back in the next
release. You have
two options:
  - either use the old importer from the 1.4.0 release,
  - use the new importer from the 1.4.1-SNAPSHOT. This is available from
maven, see our webpage on
    how to use snapshot versions.  The new importer has a `VertexProvider`
which you can set and bypass
    the automatic vertex creation. You provide a function which receives
the id from file as an argument and
    creates the new vertex.

We will be releasing 1.4.1 soon.

In any case, see the following link for more details:
https://stackoverflow.com/questions/61089620/import-a-edgelist-graph-using-its-elements-as-labels-with-jgrapht-1-4-0

Best,
D.

‪On Sun, Jun 7, 2020 at 12:38 AM ‫ניב פגיר‬‎ <ni...@gm...> wrote:‬

> Hi All,
>
> first time using jgrapht, and I can't seem to use the newer DOTImporter,
> nor do I find proper documentation for it.
>
> my dot string is simple (for now):
> digraph graphname {
> 1->2
> 2->3
> 2->5
> 5->2
> 3->5}
>
> I would like to have the vertices names be the ids from the dot string,
> however the DOTImporter
> only receives a string supplier as an argument, which can't know the id of
> the input dot string,
> I found the `addVertexAttributeConsumer` but I can't seem to remove the
> vertices created by the
> supplier, moreover, creating new vertices doesn't create the edges
> (although that might be
> possible to do with the `addEdgeConsumer` function, but I haven't got
> there yet).
>
> I would appreciate some clarification or guidance to what I have missed
> and what is or isn't possible with DOTImporter.
>
> Thanks,
> Niv
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

[jgrapht-users] Confused with using DOT importer in the latest version

[ניב פ. <ni...@gm...>]

Hi All,

first time using jgrapht, and I can't seem to use the newer DOTImporter,
nor do I find proper documentation for it.

my dot string is simple (for now):
digraph graphname {
1->2
2->3
2->5
5->2
3->5}

I would like to have the vertices names be the ids from the dot string,
however the DOTImporter
only receives a string supplier as an argument, which can't know the id of
the input dot string,
I found the `addVertexAttributeConsumer` but I can't seem to remove the
vertices created by the
supplier, moreover, creating new vertices doesn't create the edges
(although that might be
possible to do with the `addEdgeConsumer` function, but I haven't got there
yet).

I would appreciate some clarification or guidance to what I have missed and
what is or isn't possible with DOTImporter.

Thanks,
Niv

[jgrapht-users] JGraphT publication

[Dimitrios M. <dim...@gm...>]

Exciting news!

Our research paper on JGraphT has been published in the May 2020 issue of
the
ACM's Transactions on Mathematical Software. Besides a comprehensive
overview of the
library's design, it also includes some detailed performance analysis, with
comparisons
against other popular graph libraries across various platforms (not just
Java).

If you cite JGraphT in your own work, please use this published version
rather than the
preprint.

Here is the link:   https://dl.acm.org/doi/10.1145/3381449

Regards,
Dimitrios Michail

[jgrapht-users] Building a Graph with a Custom Vertex and Edge classes, and using the interface? & GraphImport

[docker d. <dev...@gm...>]

Hi,

I have been troubled by these issues over the last few days.

I am looking to build the graph outlined in the attached Graphml document.
Initially i tried to use GraphMLImporter, this came to no avail i was
continually receiving Parsing error my initial enquiry can be seen here:
https://stackoverflow.com/questions/61042189/jgrapht-failed-to-parse-graph

If anyone can show me how to import my graph that would solve my problem
immediately as i wouldn't have to go through the process of building and
trying to add my vertices and edges manually. I am at my wits end with this
some help on that would be really appreciated. I can send you any data or
the documents you need to help.

Failing that i have been trying to build the graph myself as i need to run
Dijkstra on the graph, i have created an ArrayList<Node> and
ArrayList<Edge> and i am trying to add them to a directed graph, I think i
may be missing the vertex interface at some point. Any help and pointers
would really help and you might save a man form pulling the rest of his
hair out.

public void createWayGraph(Context context) throws IOException {

    venueGraphTypeBuilder = GraphTypeBuilder
            .directed()
            .edgeClass(WayEdge.class)
            .vertexClass(WayNode.class)
            .weighted(true);
    venueGraph = venueGraphTypeBuilder.buildGraph();
   for(WayNode wn:wayNodeArrayList){
           venueGraph.addVertex(wn);
    }
    System.out.println("ddddddd "+venueGraph);
   for(WayEdge we:wayEdgeArrayList){
       venueGraph.addEdge(findSource(we), findDestination(we));
   }}

public WayNode findSource(WayEdge we){
    WayNode wn = null;
    for(WayNode w:wayNodeArrayList){
        String wayId = w.getId();
        String edgeSource = we.getSource();
        if(wayId==edgeSource){
            wn=w;
        }
    }
    return wn;
}

public WayNode findDestination(WayEdge we){
    WayNode wn = null;
    for(WayNode w:wayNodeArrayList){
        String wayId = w.getId();
        String edgeTarget = we.getTarget();
        if(wayId==edgeTarget){
            wn=w;
        }
    }
    return wn;
}


I get the error:

Caused by: java.lang.NullPointerException: throw with null exception
        at org.jgrapht.graph.AbstractGraph.assertVertexExist(AbstractGraph.java:129)
        at org.jgrapht.graph.AbstractBaseGraph.addEdge(AbstractBaseGraph.java:214)
        at com.app.WayGraph.WayGraph.createWayGraph(WayGraph.java:65)




I hope someone can help, Importing the graph would be the ideal option
as it will be the way i need to work.

Kindest regards,


Phil.

Re: [jgrapht-users] GraphT v1.4.0 released

[John S. <js...@gm...>]

Great work everyone!

On Fri, Feb 21, 2020 at 9:02 PM Joris Kinable <j.k...@gm...> wrote:

> Hi all,
>
> JGraphT version 1.4.0 has been released! Moving forward, the 1.4.0
> release is an important one. This is the last release for Java 1.8, since
> Java 1.8 reached its end-of-life status in 2019. The next release will
> require Java 11.
>
> JGraphT 1.4.0 comes with a number of significant improvements and
> enhancements. We overhauled the way graphs are imported and exported. The
> new importers essentially decouple the parsing from the graph construction.
> You now have the option of parsing without building the graph. This is
> crucial if you want to bulk import a graph, or when you need to create
> immutable graphs which require to supply the graph structure as part of the
> constructor. This is also helpful if you want to combine our parsers with
> other libraries. Next to changes to the importers & exporters, new,
> optimized classes to model sparse graphs have been added. These are
> essential for high-performance computing applications. Finally, JGraphT now
> also includes a graph drawing/layout component which allows you to project
> graphs onto a 2-dimensional surface using various popular layout
> algorithms. Many thanks to Dimitrios Michael for contributing these big
> changes.
> Next to structural changes, many developers made important algorithmic
> contributions. Thanks to the efforts of Semen Chudakov and Timofey Chudakov
> we have added various state-of-the-art routing and shortest path algorithms
> based on contraction hierarchies. Moreover, one of our oldest open-tasks
> has finally been closed: we have proper support for planarity testing!
>
> For a complete overview of all the changes, refer to the changelog
> <https://github.com/jgrapht/jgrapht/blob/master/HISTORY.md>.
>
> cheers,
>
> Joris Kinable
>
> --
> You received this message because you are subscribed to the Google Groups
> "jgrapht-gsoc" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to jgr...@go....
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/jgrapht-gsoc/CAPEkHr6mKB6ODo-04QVCHYW3wCenXoLPuu-mJQoW_9vRAVUZNA%40mail.gmail.com
> <https://groups.google.com/d/msgid/jgrapht-gsoc/CAPEkHr6mKB6ODo-04QVCHYW3wCenXoLPuu-mJQoW_9vRAVUZNA%40mail.gmail.com?utm_medium=email&utm_source=footer>
> .
>

[jgrapht-users] GraphT v1.4.0 released

[Joris K. <j.k...@gm...>]

Hi all,

JGraphT version 1.4.0 has been released! Moving forward, the 1.4.0 release
is an important one. This is the last release for Java 1.8, since Java 1.8
reached its end-of-life status in 2019. The next release will require Java
11.

JGraphT 1.4.0 comes with a number of significant improvements and
enhancements. We overhauled the way graphs are imported and exported. The
new importers essentially decouple the parsing from the graph construction.
You now have the option of parsing without building the graph. This is
crucial if you want to bulk import a graph, or when you need to create
immutable graphs which require to supply the graph structure as part of the
constructor. This is also helpful if you want to combine our parsers with
other libraries. Next to changes to the importers & exporters, new,
optimized classes to model sparse graphs have been added. These are
essential for high-performance computing applications. Finally, JGraphT now
also includes a graph drawing/layout component which allows you to project
graphs onto a 2-dimensional surface using various popular layout
algorithms. Many thanks to Dimitrios Michael for contributing these big
changes.
Next to structural changes, many developers made important algorithmic
contributions. Thanks to the efforts of Semen Chudakov and Timofey Chudakov
we have added various state-of-the-art routing and shortest path algorithms
based on contraction hierarchies. Moreover, one of our oldest open-tasks
has finally been closed: we have proper support for planarity testing!

For a complete overview of all the changes, refer to the changelog
<https://github.com/jgrapht/jgrapht/blob/master/HISTORY.md>.

cheers,

Joris Kinable

[jgrapht-users] GSoC 2019 inventorying project ideas

[Joris K. <j.k...@gm...>]

Dear community members,

We are preparing our application package for the Google Summer of Code
(GSoC) 2019! For those of you who don't know: GSoC is an international
program organized and sponsored by Google to support open source projects.
In GSoC, university students collaborate with open source organizations to
work on full-time projects for a duration of 3 months. This is a highly
competitive and prestigious program, for both students and the open source
organizations.

Last year's GSoC was an overwhelming success. We received over 120
applications from students all over the world. Many of the applicants
contributed valuable code and documentation improvements. Our 2 GSoC
graduates both completed impressive projects, including enhanced support
for trees as well as algorithms for weighted matchings which are on par
with the state-of-the-art! On top of that, we got a brand new logo, new
website, and a reworked wiki!

In preparation of this year's GSoC, we need your help. We are currently
updating our Open tasks, projects and collaboration ideas page (
https://github.com/jgrapht/jgrapht/wiki/Open-tasks%2C-projects-and--collaboration-ideas)
as well as our GSoC 2019 Project Ideas page (
https://github.com/jgrapht/jgrapht/wiki/Google-Summer-of-Code-2019-Project-Ideas
).

*We need your input:*
-What algorithms/features/components would you like us to add to JGraphT?
-What features did you find in other (graph) libraries that are missing in
JGraphT?
-What performance issues did you encounter while using JGraphT?
-Can you identify larger projects that would be suitable for GSoC?
-What functionality would benefit your academic research or industry
projects?
-Are there any subareas such as computational biology/social network
analysis/economics/vehicle routing/... that are underrepresented?

Any kind of input is appreciated: both smaller tasks that would typically
go on our 'Open tasks lists' as well as larger project
descriptions/directions that could serve as GSoC projects. Clearly, as a
dev-team we have finite resources. It is very important to us that we
allocate these resources as effective as possible. Consequently, your input
here is invaluable to determine which developments we should prioritize!

Joris Kinable

[jgrapht-users] we have a winner in the logo contest

[John S. <js...@gm...>]

You can see the final design here:

https://github.com/jgrapht/jgrapht/blob/master/etc/logo/jgrapht-logo-transparent.png

We'll be rolling it out to the website and other places soon.

Re: [jgrapht-users] [jgrapht-dev] GraphT v1.3.0 released

[John S. <js...@gm...>]

Thanks Joris!

A couple of other release notes:

* For those who use JGraphT under the Eclipse Public License, the license
version has been upgraded to 2.0.

* In the release archives, we used to provide a number of different uber
jars for various dependencies.  These have been replaced with a single
bundle jar containing all dependencies rolled together.  (This included
fastutil, so the bundle jar is quite large.)

On Mon, Nov 12, 2018 at 8:57 PM Joris Kinable <j.k...@gm...> wrote:

> Hi all,
>
> JGraphT, version 1.3.0, has been released!
> Again, the performance of a number of algorithms has been boosted, and,
> thanks to your contributions, many new algorithms have been added. Most
> important to note is that all work performed by our GSoC students is
> included in this release! Thanks to Alexandru Văleanu and Timofey Chudakov!
> We have also added a new jgrapht-opt package which includes graph
> implementations optimized for certain specialized use-cases, e.g. low
> memory consumption.
>
> For a complete overview of all the changes, refer to the changelog
> <https://github.com/jgrapht/jgrapht/blob/master/HISTORY.md>.
>
> Finally, for those of you who are new to JGraphT, we have added a new user
> guide to get you started: https://jgrapht.org/guide/UserOverview
>
>
> br,
>
> Joris Kinable
>
> --
> You received this message because you are subscribed to the Google Groups
> "jgrapht-dev" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to jgr...@go....
> Visit this group at https://groups.google.com/group/jgrapht-dev.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/jgrapht-dev/CAPEkHr4-o5y5Lt_%3DPikFXfduaRZPvv_mSd_nW60TXBgY8FVBPA%40mail.gmail.com
> <https://groups.google.com/d/msgid/jgrapht-dev/CAPEkHr4-o5y5Lt_%3DPikFXfduaRZPvv_mSd_nW60TXBgY8FVBPA%40mail.gmail.com?utm_medium=email&utm_source=footer>
> .
> For more options, visit https://groups.google.com/d/optout.
>

[jgrapht-users] GraphT v1.3.0 released

[Joris K. <j.k...@gm...>]

Hi all,

JGraphT, version 1.3.0, has been released!
Again, the performance of a number of algorithms has been boosted, and,
thanks to your contributions, many new algorithms have been added. Most
important to note is that all work performed by our GSoC students is
included in this release! Thanks to Alexandru Văleanu and Timofey Chudakov!
We have also added a new jgrapht-opt package which includes graph
implementations optimized for certain specialized use-cases, e.g. low
memory consumption.

For a complete overview of all the changes, refer to the changelog
<https://github.com/jgrapht/jgrapht/blob/master/HISTORY.md>.

Finally, for those of you who are new to JGraphT, we have added a new user
guide to get you started: https://jgrapht.org/guide/UserOverview


br,

Joris Kinable

Re: [jgrapht-users] logo design

[John S. <js...@gm...>]

You can follow along with the contest progress here:

https://99designs.com/contests/868243/entries

I've started giving feedback to the designers; if you see an entry you
particularly like, or have ideas about how to improve an existing entry
with potential, let me know so that I can give feedback accordingly.


On Mon, Nov 5, 2018 at 11:38 PM John Sichi <js...@gm...> wrote:

> OK, I've kicked off the contest here:
>
>
> https://99designs.com/logo-design/contests/design-spiffy-logo-jgrapht-open-source-project-868243
>
> Let me know if you have any suggested edits for the design brief.
>
> For the first try, I selected the cheapest option.  It'll run for a week.
> If we don't like any of the proposals, there's a money back guarantee; if
> that happens, then we'll reject them all and then restart a second contest
> with a higher price to attract better designs.
>
> On Fri, Oct 26, 2018 at 9:21 AM Joris Kinable <j.k...@gm...> wrote:
>
>> I kinda dislike the logos from the other projects. Several of them look
>> like they were drawn by a child with a crayon... I like something a bit
>> more sophisticated, like this:
>> [image: image.png]
>> I expect that once we have a cool logo, we'll be selling t-shirts like
>> crazy, so it better be a nice logo ;)
>>
>> Joris
>>
>>
>>
>>
>>
>>
>> On Wed, Oct 17, 2018 at 4:51 AM John Sichi <js...@gm...> wrote:
>>
>>> Hey all,
>>>
>>> One of the items that came up in discussions at last weekend's GSoC
>>> mentor summit is that we really need to come up with a logo as part of the
>>> website revamp.  Since we don't have volunteers available for this, we're
>>> planning to pay for a 99designs contest using our GSoC budget.
>>>
>>> As part of putting together the brief for designers to work from, it's
>>> helpful to have some example logos to give them an idea of what we're
>>> looking for.  We'll initially be using the logo online, but it may also
>>> find its way onto stickers, T-shirts, etc.
>>>
>>> If you have design suggestions, or like the style of logos from other
>>> projects which would serve as good examples, please reply here.  Here are a
>>> few logos from other graph libraries; it would be nice to come up with
>>> something a little more fun/eye-catching.
>>>
>>> http://graphstream-project.org/
>>>
>>> http://igraph.org
>>>
>>> http://pyviz.org/tutorial/06_Network_Graphs.html
>>>
>>>
>>> https://www.boost.org/doc/libs/1_64_0/libs/graph_parallel/doc/html/index.html
>>>
>>> _______________________________________________
>>> jgrapht-users mailing list
>>> jgr...@li...
>>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>>
>>

Re: [jgrapht-users] logo design

[John S. <js...@gm...>]

OK, I've kicked off the contest here:

https://99designs.com/logo-design/contests/design-spiffy-logo-jgrapht-open-source-project-868243

Let me know if you have any suggested edits for the design brief.

For the first try, I selected the cheapest option.  It'll run for a week.
If we don't like any of the proposals, there's a money back guarantee; if
that happens, then we'll reject them all and then restart a second contest
with a higher price to attract better designs.

On Fri, Oct 26, 2018 at 9:21 AM Joris Kinable <j.k...@gm...> wrote:

> I kinda dislike the logos from the other projects. Several of them look
> like they were drawn by a child with a crayon... I like something a bit
> more sophisticated, like this:
> [image: image.png]
> I expect that once we have a cool logo, we'll be selling t-shirts like
> crazy, so it better be a nice logo ;)
>
> Joris
>
>
>
>
>
>
> On Wed, Oct 17, 2018 at 4:51 AM John Sichi <js...@gm...> wrote:
>
>> Hey all,
>>
>> One of the items that came up in discussions at last weekend's GSoC
>> mentor summit is that we really need to come up with a logo as part of the
>> website revamp.  Since we don't have volunteers available for this, we're
>> planning to pay for a 99designs contest using our GSoC budget.
>>
>> As part of putting together the brief for designers to work from, it's
>> helpful to have some example logos to give them an idea of what we're
>> looking for.  We'll initially be using the logo online, but it may also
>> find its way onto stickers, T-shirts, etc.
>>
>> If you have design suggestions, or like the style of logos from other
>> projects which would serve as good examples, please reply here.  Here are a
>> few logos from other graph libraries; it would be nice to come up with
>> something a little more fun/eye-catching.
>>
>> http://graphstream-project.org/
>>
>> http://igraph.org
>>
>> http://pyviz.org/tutorial/06_Network_Graphs.html
>>
>>
>> https://www.boost.org/doc/libs/1_64_0/libs/graph_parallel/doc/html/index.html
>>
>> _______________________________________________
>> jgrapht-users mailing list
>> jgr...@li...
>> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>>
>

Re: [jgrapht-users] logo design

[Joris K. <j.k...@gm...>]

I kinda dislike the logos from the other projects. Several of them look
like they were drawn by a child with a crayon... I like something a bit
more sophisticated, like this:
[image: image.png]
I expect that once we have a cool logo, we'll be selling t-shirts like
crazy, so it better be a nice logo ;)

Joris






On Wed, Oct 17, 2018 at 4:51 AM John Sichi <js...@gm...> wrote:

> Hey all,
>
> One of the items that came up in discussions at last weekend's GSoC mentor
> summit is that we really need to come up with a logo as part of the website
> revamp.  Since we don't have volunteers available for this, we're planning
> to pay for a 99designs contest using our GSoC budget.
>
> As part of putting together the brief for designers to work from, it's
> helpful to have some example logos to give them an idea of what we're
> looking for.  We'll initially be using the logo online, but it may also
> find its way onto stickers, T-shirts, etc.
>
> If you have design suggestions, or like the style of logos from other
> projects which would serve as good examples, please reply here.  Here are a
> few logos from other graph libraries; it would be nice to come up with
> something a little more fun/eye-catching.
>
> http://graphstream-project.org/
>
> http://igraph.org
>
> http://pyviz.org/tutorial/06_Network_Graphs.html
>
>
> https://www.boost.org/doc/libs/1_64_0/libs/graph_parallel/doc/html/index.html
>
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

[jgrapht-users] logo design

[John S. <js...@gm...>]

Hey all,

One of the items that came up in discussions at last weekend's GSoC mentor
summit is that we really need to come up with a logo as part of the website
revamp.  Since we don't have volunteers available for this, we're planning
to pay for a 99designs contest using our GSoC budget.

As part of putting together the brief for designers to work from, it's
helpful to have some example logos to give them an idea of what we're
looking for.  We'll initially be using the logo online, but it may also
find its way onto stickers, T-shirts, etc.

If you have design suggestions, or like the style of logos from other
projects which would serve as good examples, please reply here.  Here are a
few logos from other graph libraries; it would be nice to come up with
something a little more fun/eye-catching.

http://graphstream-project.org/

http://igraph.org

http://pyviz.org/tutorial/06_Network_Graphs.html

https://www.boost.org/doc/libs/1_64_0/libs/graph_parallel/doc/html/index.html

Re: [jgrapht-users] Chinese Postman Problem

[Frank G. <fra...@fk...>]

Hi Joris,

That's excellent news! Thank you, and everyone involved.
I'm currently working on a major new version of the software I needed it for last year, so this will definitely come in handy.

Frank


On Thu, Sep 20, 2018 at 01:13:52AM +0200, Joris Kinable wrote:
> Hi Frank,
> 
> Just to let you know, we now have a fully-functional algorithm for the
> Chinese Postman Problem in jgrapht which supports both directed and
> undirected, weighted and unweighted graphs.
> 
> br,
> 
> Joris Kinable
> 
> On Wed, Mar 29, 2017 at 11:58 PM Frank Gevaerts <fra...@fk...>
> wrote:
> 
> > Hi Joris,
> >
> > It turns out that the number of odd vertices is fairly small for my
> > dataset,
> > so I can actually just brute-force it most of the time and find some
> > heuristics for the one of two cases where the number is too large. Having
> > a non-optimal solution for just a few cases is acceptable. I did manage
> > to add that to your code, so we're happy for now.
> >
> > Frank
> >
> > On Tue, Mar 28, 2017 at 12:46:59PM -0400, J Kinable wrote:
> > > Hi Frank,
> > >
> > > It turns out there's a flaw in the CPP implementation for *undirected*
> > > graphs.
> > > To solve the Chinese Postman Problem (CPP) for *undirected* graphs, it is
> > > necessary to compute a min cost perfect matching in a complete graph.
> > > Currently, JGraphT doesn't have such an algorithm. Initially I tried to
> > get
> > > away with this by duplicating all the nodes in the complete graph and
> > > solving a min cost perfect matching on the resulting bipartite graph;
> > this
> > > works for most, but, as you found out, not for all cases :(.
> > >
> > > The CPP implementation for *directed* graphs works fine and is unaffected
> > > by this issue.
> > >
> > > To solve the aforementioned Matching problem, ideally we implement this
> > > paper:
> > > Kolmogorov, V. Blossom V: a new implementation of a minimum cost perfect
> > > matching algorithm. Math. Prog. Comp. (2009) 1: 43.
> > > doi:10.1007/s12532-009-0002-8
> > > To the best of my knowledge, this is the fastest implementation at the
> > > moment.
> > >
> > > I'm not aware of any simple-and-quick-to-implement algorithms for the min
> > > cost perfect matching problem in complete graphs, so it might take some
> > > time before we have a suitable implementation to solve this issue. Until
> > > then, the CPP implementation cannot be merged into JgraphT's master
> > branch.
> > > On the bright side: the commented-out code at the bottom of
> > > ChinesePostman.java already fixes the flaw (it just requires a matching
> > > algorithm).
> > >
> > > Obviously, this is not going to help you out in the short run, so here
> > are
> > > 2 possible alternative solutions you could use:
> > >
> > > 1. The CPP code for directed graphs works fine so you could use that.
> > >
> > > 2. At the bottom of ChinesePostman.java
> > > <
> > https://github.com/jgrapht/jgrapht/pull/385/files#diff-17a47bf2dc488441cb3b7a7f7e2ff318
> > >
> > > there
> > > is commented-out code: this would be the correct implementation for the
> > > *undirected* version of the algorithm. You could use that code. Problem:
> > > this code needs a solver for the Min cost perfect matching problem in
> > > complete graphs. You would have to provide a solver for this yourself, as
> > > such a solver is currently not present in JGraphT. Here you have 3
> > options:
> > >
> > > a. use a matching solver from some alternative open/closed source
> > project.
> > >
> > > b. implement a solver using an Integer Programming solver (assuming you
> > > have access to such a solver, this would be easy, as implementing the
> > > matching problem as a Mixed Integer Programming Problem is
> > straightforward).
> > > c. implement a heuristic to solve the matching problem (this is rather
> > > suboptimal, since you may obviously loose the optimal solution)
> > >
> > >
> > > Btw, thanks for exposing this flaw!
> > >
> > >
> > > br,
> > >
> > >
> > > Joris Kinable
> > >
> > > On Mon, Mar 27, 2017 at 6:21 PM, J Kinable <j.k...@gm...> wrote:
> > >
> > > > I'm afraid you've encountered a bug... :( As long as the graph is
> > strongly
> > > > connected (which is the case for your graph), then it must be possible
> > to
> > > > find a feasible tour. For this H-shaped graph, I would expect a tour
> > which
> > > > passes each edge exactly twice.
> > > > Thanks for reporting; I'll look into it.
> > > >
> > > > Joris Kinable
> > > >
> > > > On Mon, Mar 27, 2017 at 12:21 PM, Frank Gevaerts <
> > fra...@fk...>
> > > > wrote:
> > > >
> > > >> Thank you, this is very helpful. I have tried this on our dataset,
> > and it
> > > >> works for most of our dataset.
> > > >> One case I'm not entirely sure of is a H-shaped graph:
> > > >>
> > > >>             Graph<Integer, DefaultWeightedEdge> g=new
> > > >> SimpleWeightedGraph<>(DefaultWeightedEdge.class);
> > > >>             Graphs.addAllVertices(g, Arrays.asList(1, 2, 3, 4, 5, 6));
> > > >>             Graphs.addEdge(g, 1, 2, 1);
> > > >>             Graphs.addEdge(g, 2, 3, 1);
> > > >>             Graphs.addEdge(g, 3, 4, 1);
> > > >>             Graphs.addEdge(g, 2, 5, 1);
> > > >>             Graphs.addEdge(g, 3, 6, 1);
> > > >>
> > > >> Trying to get the CPP path for that gives me
> > > >> java.lang.IllegalArgumentException: Graph is not Eulerian
> > > >>
> > > >> I'm not entirely sure if this case is expected to work though.
> > > >>
> > > >> Frank
> > > >>
> > > >> `
> > > >> On Sun, Mar 26, 2017 at 04:36:41PM -0400, J Kinable wrote:
> > > >> > I've opened a pull request for the Chinese Postman Problem:
> > > >> > https://github.com/jgrapht/jgrapht/pull/385
> > > >> > The implementation supports both directed and undirected graphs. I
> > > >> realized
> > > >> > why I didn't finish the implementation initially: ideally the
> > algorithm
> > > >> > requires a fast algorithm for Max Weight matchings in complete
> > graphs,
> > > >> but
> > > >> > currently JgraphT doesn't have such implementation. As a trade-off I
> > > >> used a
> > > >> > slower bipartite matching algorithm.
> > > >> >
> > > >> > The code is fully functional and tested, but its final inclusion in
> > > >> JGraphT
> > > >> > will obviously depend on the review process. Feel free to fork my
> > github
> > > >> > branch or wait until the implementation makes its way to Jgrapht's
> > > >> master
> > > >> > branch.
> > > >> >
> > > >> >
> > > >> > br,
> > > >> >
> > > >> > Joris Kinable
> > > >> >
> > > >> > On Wed, Mar 22, 2017 at 3:40 PM, J Kinable <j.k...@gm...>
> > wrote:
> > > >> >
> > > >> > > Hi Frank,
> > > >> > >
> > > >> > > Currently JGraphT doesn't have algorithms for the Chinese Postman
> > > >> Problem
> > > >> > > (CPP).
> > > >> > >
> > > >> > > 1. Solving the CPP for mixed graphs is NP-hard. As far as I know,
> > the
> > > >> best
> > > >> > > performing methods to solve the CPP for mixed graphs use Integer
> > > >> Linear
> > > >> > > Program Solvers. This is however hard to do in JGraphT since the
> > best
> > > >> > > performing solvers (Cplex/Gurobi) are commercial and don't have a
> > > >> common
> > > >> > > interface. Similar issues appear for open source solvers. I'm not
> > > >> aware of
> > > >> > > any open source graph libraries that provide an implementation
> > for the
> > > >> > > Mixed CPP.
> > > >> > >
> > > >> > > 2. On the other hand, the CPP for undirected graphs is much
> > easier. At
> > > >> > > some point in the past I was working on an implementation for
> > > >> JGraphT. I
> > > >> > > can see whether I can finish it somewhere this week (that is, if I
> > > >> can find
> > > >> > > on which computer I stored it :) ).
> > > >> > >
> > > >> > > br,
> > > >> > >
> > > >> > > Joris Kinable
> > > >> > >
> > > >> > > On Wed, Mar 22, 2017 at 1:10 PM, Frank Gevaerts <
> > > >> fra...@fk...>
> > > >> > > wrote:
> > > >> > >
> > > >> > >> Hi,
> > > >> > >>
> > > >> > >> I'm looking for a library that can solve the Chinese Postman
> > Problem
> > > >> (i.e.
> > > >> > >> finding a (ideally shortest) route that uses all edges in a
> > graph),
> > > >> either
> > > >> > >> for undirected graphs, or for mixed graphs. Can JGraphT handle
> > this,
> > > >> or
> > > >> > >> does
> > > >> > >> anyone know a different library I can use?
> > > >> > >>
> > > >> > >> My searches only seem to turn up academic papers but no usable
> > code.
> > > >> > >>
> > > >> > >> Frank
> > > >> > >>
> > > >> > >> --
> > > >> > >> Frank Gevaerts
> > fra...@fk...
> > > >> > >> fks bvba - Formal and Knowledge Systems
> > http://www.fks.be/
> > > >> > >> Schampbergstraat 32                            Tel:
> > ++32-(0)11-21
> > > >> 49 11
> > > >> > >> B-3511 KURINGEN-HASSELT                        Fax:
> > ++32-(0)11-22
> > > >> 04 19
> > > >> > >>
> > > >> > >> ------------------------------------------------------------
> > > >> > >> ------------------
> > > >> > >> Check out the vibrant tech community on one of the world's most
> > > >> > >> engaging tech sites, Slashdot.org! http://sdm.link/slashdot
> > > >> > >> _______________________________________________
> > > >> > >> jgrapht-users mailing list
> > > >> > >> jgr...@li...
> > > >> > >> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> > > >> > >>
> > > >> > >
> > > >> > >
> > > >>
> > > >> --
> > > >> Frank Gevaerts                                 fra...@fk...
> > > >> fks bvba - Formal and Knowledge Systems        http://www.fks.be/
> > > >> Schampbergstraat 32                            Tel:  ++32-(0)11-21 49
> > 11
> > > >> B-3511 KURINGEN-HASSELT                        Fax:  ++32-(0)11-22 04
> > 19
> > > >>
> > > >
> > > >
> >
> > --
> > Frank Gevaerts                                 fra...@fk...
> > fks bvba - Formal and Knowledge Systems        http://www.fks.be/
> > Schampbergstraat 32                            Tel:  ++32-(0)11-21 49 11
> > B-3511 KURINGEN-HASSELT                        Fax:  ++32-(0)11-22 04 19
> >

-- 
Frank Gevaerts                                 fra...@fk...
fks bvba - Formal and Knowledge Systems        http://www.fks.be/
Schampbergstraat 32                            Tel:  ++32-(0)11-21 49 11
B-3511 KURINGEN-HASSELT                        Fax:  ++32-(0)11-22 04 19

Re: [jgrapht-users] Chinese Postman Problem

[Joris K. <j.k...@gm...>]

Hi Frank,

Just to let you know, we now have a fully-functional algorithm for the
Chinese Postman Problem in jgrapht which supports both directed and
undirected, weighted and unweighted graphs.

br,

Joris Kinable

On Wed, Mar 29, 2017 at 11:58 PM Frank Gevaerts <fra...@fk...>
wrote:

> Hi Joris,
>
> It turns out that the number of odd vertices is fairly small for my
> dataset,
> so I can actually just brute-force it most of the time and find some
> heuristics for the one of two cases where the number is too large. Having
> a non-optimal solution for just a few cases is acceptable. I did manage
> to add that to your code, so we're happy for now.
>
> Frank
>
> On Tue, Mar 28, 2017 at 12:46:59PM -0400, J Kinable wrote:
> > Hi Frank,
> >
> > It turns out there's a flaw in the CPP implementation for *undirected*
> > graphs.
> > To solve the Chinese Postman Problem (CPP) for *undirected* graphs, it is
> > necessary to compute a min cost perfect matching in a complete graph.
> > Currently, JGraphT doesn't have such an algorithm. Initially I tried to
> get
> > away with this by duplicating all the nodes in the complete graph and
> > solving a min cost perfect matching on the resulting bipartite graph;
> this
> > works for most, but, as you found out, not for all cases :(.
> >
> > The CPP implementation for *directed* graphs works fine and is unaffected
> > by this issue.
> >
> > To solve the aforementioned Matching problem, ideally we implement this
> > paper:
> > Kolmogorov, V. Blossom V: a new implementation of a minimum cost perfect
> > matching algorithm. Math. Prog. Comp. (2009) 1: 43.
> > doi:10.1007/s12532-009-0002-8
> > To the best of my knowledge, this is the fastest implementation at the
> > moment.
> >
> > I'm not aware of any simple-and-quick-to-implement algorithms for the min
> > cost perfect matching problem in complete graphs, so it might take some
> > time before we have a suitable implementation to solve this issue. Until
> > then, the CPP implementation cannot be merged into JgraphT's master
> branch.
> > On the bright side: the commented-out code at the bottom of
> > ChinesePostman.java already fixes the flaw (it just requires a matching
> > algorithm).
> >
> > Obviously, this is not going to help you out in the short run, so here
> are
> > 2 possible alternative solutions you could use:
> >
> > 1. The CPP code for directed graphs works fine so you could use that.
> >
> > 2. At the bottom of ChinesePostman.java
> > <
> https://github.com/jgrapht/jgrapht/pull/385/files#diff-17a47bf2dc488441cb3b7a7f7e2ff318
> >
> > there
> > is commented-out code: this would be the correct implementation for the
> > *undirected* version of the algorithm. You could use that code. Problem:
> > this code needs a solver for the Min cost perfect matching problem in
> > complete graphs. You would have to provide a solver for this yourself, as
> > such a solver is currently not present in JGraphT. Here you have 3
> options:
> >
> > a. use a matching solver from some alternative open/closed source
> project.
> >
> > b. implement a solver using an Integer Programming solver (assuming you
> > have access to such a solver, this would be easy, as implementing the
> > matching problem as a Mixed Integer Programming Problem is
> straightforward).
> > c. implement a heuristic to solve the matching problem (this is rather
> > suboptimal, since you may obviously loose the optimal solution)
> >
> >
> > Btw, thanks for exposing this flaw!
> >
> >
> > br,
> >
> >
> > Joris Kinable
> >
> > On Mon, Mar 27, 2017 at 6:21 PM, J Kinable <j.k...@gm...> wrote:
> >
> > > I'm afraid you've encountered a bug... :( As long as the graph is
> strongly
> > > connected (which is the case for your graph), then it must be possible
> to
> > > find a feasible tour. For this H-shaped graph, I would expect a tour
> which
> > > passes each edge exactly twice.
> > > Thanks for reporting; I'll look into it.
> > >
> > > Joris Kinable
> > >
> > > On Mon, Mar 27, 2017 at 12:21 PM, Frank Gevaerts <
> fra...@fk...>
> > > wrote:
> > >
> > >> Thank you, this is very helpful. I have tried this on our dataset,
> and it
> > >> works for most of our dataset.
> > >> One case I'm not entirely sure of is a H-shaped graph:
> > >>
> > >>             Graph<Integer, DefaultWeightedEdge> g=new
> > >> SimpleWeightedGraph<>(DefaultWeightedEdge.class);
> > >>             Graphs.addAllVertices(g, Arrays.asList(1, 2, 3, 4, 5, 6));
> > >>             Graphs.addEdge(g, 1, 2, 1);
> > >>             Graphs.addEdge(g, 2, 3, 1);
> > >>             Graphs.addEdge(g, 3, 4, 1);
> > >>             Graphs.addEdge(g, 2, 5, 1);
> > >>             Graphs.addEdge(g, 3, 6, 1);
> > >>
> > >> Trying to get the CPP path for that gives me
> > >> java.lang.IllegalArgumentException: Graph is not Eulerian
> > >>
> > >> I'm not entirely sure if this case is expected to work though.
> > >>
> > >> Frank
> > >>
> > >> `
> > >> On Sun, Mar 26, 2017 at 04:36:41PM -0400, J Kinable wrote:
> > >> > I've opened a pull request for the Chinese Postman Problem:
> > >> > https://github.com/jgrapht/jgrapht/pull/385
> > >> > The implementation supports both directed and undirected graphs. I
> > >> realized
> > >> > why I didn't finish the implementation initially: ideally the
> algorithm
> > >> > requires a fast algorithm for Max Weight matchings in complete
> graphs,
> > >> but
> > >> > currently JgraphT doesn't have such implementation. As a trade-off I
> > >> used a
> > >> > slower bipartite matching algorithm.
> > >> >
> > >> > The code is fully functional and tested, but its final inclusion in
> > >> JGraphT
> > >> > will obviously depend on the review process. Feel free to fork my
> github
> > >> > branch or wait until the implementation makes its way to Jgrapht's
> > >> master
> > >> > branch.
> > >> >
> > >> >
> > >> > br,
> > >> >
> > >> > Joris Kinable
> > >> >
> > >> > On Wed, Mar 22, 2017 at 3:40 PM, J Kinable <j.k...@gm...>
> wrote:
> > >> >
> > >> > > Hi Frank,
> > >> > >
> > >> > > Currently JGraphT doesn't have algorithms for the Chinese Postman
> > >> Problem
> > >> > > (CPP).
> > >> > >
> > >> > > 1. Solving the CPP for mixed graphs is NP-hard. As far as I know,
> the
> > >> best
> > >> > > performing methods to solve the CPP for mixed graphs use Integer
> > >> Linear
> > >> > > Program Solvers. This is however hard to do in JGraphT since the
> best
> > >> > > performing solvers (Cplex/Gurobi) are commercial and don't have a
> > >> common
> > >> > > interface. Similar issues appear for open source solvers. I'm not
> > >> aware of
> > >> > > any open source graph libraries that provide an implementation
> for the
> > >> > > Mixed CPP.
> > >> > >
> > >> > > 2. On the other hand, the CPP for undirected graphs is much
> easier. At
> > >> > > some point in the past I was working on an implementation for
> > >> JGraphT. I
> > >> > > can see whether I can finish it somewhere this week (that is, if I
> > >> can find
> > >> > > on which computer I stored it :) ).
> > >> > >
> > >> > > br,
> > >> > >
> > >> > > Joris Kinable
> > >> > >
> > >> > > On Wed, Mar 22, 2017 at 1:10 PM, Frank Gevaerts <
> > >> fra...@fk...>
> > >> > > wrote:
> > >> > >
> > >> > >> Hi,
> > >> > >>
> > >> > >> I'm looking for a library that can solve the Chinese Postman
> Problem
> > >> (i.e.
> > >> > >> finding a (ideally shortest) route that uses all edges in a
> graph),
> > >> either
> > >> > >> for undirected graphs, or for mixed graphs. Can JGraphT handle
> this,
> > >> or
> > >> > >> does
> > >> > >> anyone know a different library I can use?
> > >> > >>
> > >> > >> My searches only seem to turn up academic papers but no usable
> code.
> > >> > >>
> > >> > >> Frank
> > >> > >>
> > >> > >> --
> > >> > >> Frank Gevaerts
> fra...@fk...
> > >> > >> fks bvba - Formal and Knowledge Systems
> http://www.fks.be/
> > >> > >> Schampbergstraat 32                            Tel:
> ++32-(0)11-21
> > >> 49 11
> > >> > >> B-3511 KURINGEN-HASSELT                        Fax:
> ++32-(0)11-22
> > >> 04 19
> > >> > >>
> > >> > >> ------------------------------------------------------------
> > >> > >> ------------------
> > >> > >> Check out the vibrant tech community on one of the world's most
> > >> > >> engaging tech sites, Slashdot.org! http://sdm.link/slashdot
> > >> > >> _______________________________________________
> > >> > >> jgrapht-users mailing list
> > >> > >> jgr...@li...
> > >> > >> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
> > >> > >>
> > >> > >
> > >> > >
> > >>
> > >> --
> > >> Frank Gevaerts                                 fra...@fk...
> > >> fks bvba - Formal and Knowledge Systems        http://www.fks.be/
> > >> Schampbergstraat 32                            Tel:  ++32-(0)11-21 49
> 11
> > >> B-3511 KURINGEN-HASSELT                        Fax:  ++32-(0)11-22 04
> 19
> > >>
> > >
> > >
>
> --
> Frank Gevaerts                                 fra...@fk...
> fks bvba - Formal and Knowledge Systems        http://www.fks.be/
> Schampbergstraat 32                            Tel:  ++32-(0)11-21 49 11
> B-3511 KURINGEN-HASSELT                        Fax:  ++32-(0)11-22 04 19
>

[jgrapht-users] upcoming jgrapht release

[Joris K. <j.k...@gm...>]

Dear,

We are preparing a new release for jgrapht, which will be released
somewhere next month. If you still have open PRs lingering around, please
go ahead and fix+submit any remaining issues. If we haven't reviewed your
PR: we'll try to get to it asap (feel free to send us a gentle reminder).

br,

Joris Kinable

[jgrapht-users] Wrapping up Google Summer of Code 2018

[John S. <js...@gm...>]

Congratulations to our first "graduates", Alexandru Văleanu and Timofey
Chudakov, on a successful summer of code.  You can find writeups for their
projects here:

https://medium.com/@valexandru2011/gsoc-2018-enhanced-support-for-trees-jgrapht-cfb3c257038

https://medium.com/@timofey.chudakov/gsoc-2018-minimum-weight-perfect-matching-jgrapht-669ae59a1e

We're still in the process of reviewing, but we should have the bulk of
their code merged soon, in time for a release next month.

Please give them (and mentors Dimitrios and Joris) a big round of applause;
you can clap as many times as you want on the Medium articles :)

We're looking forward to their ongoing contributions to JGraphT, and
another great summer next year!

[jgrapht-users] end of life for Touchgraph support

[John S. <js...@gm...>]

We're planning to drop support for the Touchgraph adapter in the next
release, for the reasons mentioned here:

https://github.com/jgrapht/jgrapht/issues/656

If anyone is actually using it, we can help them resurrect it as a separate
project.

[jgrapht-users] EPL2 and file header updates

[John S. <js...@gm...>]

Hey all,

For the next release, we are planning to make a few minor changes to our
file headers:

* upgrade Eclipse Public License v1 (which has been deprecated) to EPL 2;
this is a mostly cosmetic change which doesn't affect the nature of the
license

* add explicit SPDX license identifiers

* remove all @since tags because the ad hoc way we've been using them isn't
connected with our releases

For more information on EPL2, see:

https://www.eclipse.org/legal/epl-2.0/faq.php

We will not be making use of the "Secondary License" feature; instead, we
will continue to use dual licensing LGPL + EPL.  Consequently, another
round of permissions requests to copyright holders is not required since
automatic upgrade provisions are built in to EPL1.

We will not be making any changes to the copyright lines or @author tags in
files.

The proposed header looks as follows:

/*
 * (C) Copyright 2003-2018, by Ben Bitdiddle and Contributors.
 *
 * See the CONTRIBUTORS.md file distributed with this work for additional
 * information regarding copyright ownership.
 *
 * This program and the accompanying materials are made available under the
 * terms of the Eclipse Public License 2.0 which is available at
 * http://www.eclipse.org/legal/epl-2.0, or the
 * GNU Lesser General Public License v2.1 or later
 * which is available at
 * http://www.gnu.org/licenses/old-licenses/lgpl-2.1-standalone.html.
 *
 * SPDX-License-Identifier: EPL-2.0 OR LGPL-2.1-or-later
 */

Please let me know if you have any questions about these changes.  For the
moment, continue to use the old header format for new contributions; we'll
let you know once the change to the new format has been applied.

Re: [jgrapht-users] website

[John S. <js...@gm...>]

Thanks for the suggestions Chris and Oliver!  The SinglePaged theme looks
like a good place to start.

I've used 99designs before with good results; if we have some funds left
over from the Google Summer of Code org stipend, we'll use that to pay for
the logo.


On Wed, Jul 4, 2018 at 10:06 PM, Oliver Kopp <kop...@gm...> wrote:

> Hi,
>
> 2018-07-02 20:02 GMT+02:00 John Sichi <js...@gm...>:
>
> > After 15 years of the same ol' HTML, we're planning to modernize the
> JGraphT
> > website and move it over to our Jekyll infrastructure.
>
> In other projects, we think of moving from Jekyll to readthedocs.io.
> Example site: https://java-object-diff.readthedocs.io/en/latest/.
> Content still hosted on GitHub. Free of charge. - The use MkDocs
> (https://www.mkdocs.org/) instead of Jekyll. - Seeing the current
> homepage and the community consuming the homepage (developers, not end
> users), I would really recommend that way.
>
> For simple projects on a single page, we surely stay on Jekyll.
> Example page: https://adr.github.io/. Source:
> https://github.com/adr/adr.github.io/blob/master/index.md. We modified
> the slate theme to have sticky headings: https://github.com/adr/slate
>
> For complex single pages, we use a variant of the "SinglePaged" theme
> by t413 (https://github.com/t413/SinglePaged). Rendered variant at:
> http://www.jabref.org/
>
> > coming up with a real logo
>
> For JabRef, we found our new logo via https://en.99designs.de/. It's
> not that cheap (https://en.99designs.de/pricing), but really worth the
> money. We used the cheapest package in JabRef (as far as I remember:
> Bronze, 259€), but it was really worth the money.
>
> Cheers,
>
> Oliver
>
> ------------------------------------------------------------
> ------------------
> Check out the vibrant tech community on one of the world's most
> engaging tech sites, Slashdot.org! http://sdm.link/slashdot
> _______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users
>

Re: [jgrapht-users] website

[Oliver K. <kop...@gm...>]

Hi,

2018-07-02 20:02 GMT+02:00 John Sichi <js...@gm...>:

> After 15 years of the same ol' HTML, we're planning to modernize the JGraphT
> website and move it over to our Jekyll infrastructure.

In other projects, we think of moving from Jekyll to readthedocs.io.
Example site: https://java-object-diff.readthedocs.io/en/latest/.
Content still hosted on GitHub. Free of charge. - The use MkDocs
(https://www.mkdocs.org/) instead of Jekyll. - Seeing the current
homepage and the community consuming the homepage (developers, not end
users), I would really recommend that way.

For simple projects on a single page, we surely stay on Jekyll.
Example page: https://adr.github.io/. Source:
https://github.com/adr/adr.github.io/blob/master/index.md. We modified
the slate theme to have sticky headings: https://github.com/adr/slate

For complex single pages, we use a variant of the "SinglePaged" theme
by t413 (https://github.com/t413/SinglePaged). Rendered variant at:
http://www.jabref.org/

> coming up with a real logo

For JabRef, we found our new logo via https://en.99designs.de/. It's
not that cheap (https://en.99designs.de/pricing), but really worth the
money. We used the cheapest package in JabRef (as far as I remember:
Bronze, 259€), but it was really worth the money.

Cheers,

Oliver

Re: [jgrapht-users] website

[Chris K W. <ch...@we...>]

I don’t have any style ideas…

but I did re-design my sites using Hugo recently. there are some templates that may work.

https://gohugo.io <https://gohugo.io/>

and I host for free via https://www.netlify.com <https://www.netlify.com/>, and its easy to get TLS/SSL certs also for free.

write in markdown, push to github, the site gets generated and pushed online.

ckw

> On Jul 2, 2018, at 11:02 AM, John Sichi <js...@gm...> wrote:
> 
> Hey all,
> 
> After 15 years of the same ol' HTML, we're planning to modernize the JGraphT website and move it over to our Jekyll infrastructure.  We're looking for ideas on how the new site should look, so if you see an open source project whose site you like, and you think it would serve as a good model for JGraphT's site, please reply with a link here.  Bonus points if it's in markdown on github.  If anyone wants to help with styling or coming up with a real logo, that would be a big plus too.
> 
> ------------------------------------------------------------------------------
> Check out the vibrant tech community on one of the world's most
> engaging tech sites, Slashdot.org! http://sdm.link/slashdot_______________________________________________
> jgrapht-users mailing list
> jgr...@li...
> https://lists.sourceforge.net/lists/listinfo/jgrapht-users

—
Chris K Wensel
ch...@we... <mailto:ch...@we...>
http://www.heretical.io <http://www.heretical.io/>

[jgrapht-users] website

[John S. <js...@gm...>]

Hey all,

After 15 years of the same ol' HTML, we're planning to modernize the
JGraphT website and move it over to our Jekyll infrastructure.  We're
looking for ideas on how the new site should look, so if you see an open
source project whose site you like, and you think it would serve as a good
model for JGraphT's site, please reply with a link here.  Bonus points if
it's in markdown on github.  If anyone wants to help with styling or coming
up with a real logo, that would be a big plus too.

[jgrapht-users] guidelines for new contributors

[John S. <js...@gm...>]

We've been receiving a lot of pull requests from new contributors lately,
which is great.  To explain what to expect during the process of getting
contributions incorporated into the codebase, we've written up some wiki
pages:

https://github.com/jgrapht/jgrapht/wiki/Become-a-Contributor

https://github.com/jgrapht/jgrapht/wiki/How-to-make-your-first-%28code%29-contribution

https://github.com/jgrapht/jgrapht/wiki/Contributor-Guidelines

So if you're thinking of sending us a pull request for a contribution
you've been working on, please give these a read through first.  Thanks!