flink-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "ASF GitHub Bot (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (FLINK-2254) Add Bipartite Graph Support for Gelly
Date Mon, 05 Dec 2016 19:41:00 GMT

    [ https://issues.apache.org/jira/browse/FLINK-2254?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15723157#comment-15723157

ASF GitHub Bot commented on FLINK-2254:

Github user greghogan commented on a diff in the pull request:

    --- Diff: flink-libraries/flink-gelly/src/main/java/org/apache/flink/graph/BipartiteGraph.java
    @@ -0,0 +1,364 @@
    + * Licensed to the Apache Software Foundation (ASF) under one
    + * or more contributor license agreements.  See the NOTICE file
    + * distributed with this work for additional information
    + * regarding copyright ownership.  The ASF licenses this file
    + * to you under the Apache License, Version 2.0 (the
    + * "License"); you may not use this file except in compliance
    + * with the License.  You may obtain a copy of the License at
    + *
    + *     http://www.apache.org/licenses/LICENSE-2.0
    + *
    + * Unless required by applicable law or agreed to in writing, software
    + * distributed under the License is distributed on an "AS IS" BASIS,
    + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    + * See the License for the specific language governing permissions and
    + * limitations under the License.
    + */
    +package org.apache.flink.graph;
    +import org.apache.flink.api.common.functions.FilterFunction;
    +import org.apache.flink.api.common.functions.MapFunction;
    +import org.apache.flink.api.java.DataSet;
    +import org.apache.flink.api.java.ExecutionEnvironment;
    +import org.apache.flink.api.java.functions.KeySelector;
    +import org.apache.flink.api.java.tuple.Tuple2;
    + *
    + * Bipartite graph is a graph whose vertices can be divided into two disjoint sets: top
vertices and bottom vertices.
    + * Edges can only exist between a pair of vertices from different vertices sets. E.g.
there can be no vertices between
    + * a pair of top vertices.
    + *
    + * <p>Bipartite graphs are useful to represent graphs with two sets of objects,
like researchers and their publications,
    + * where an edge represents that a particular publication was authored by a particular
    + *
    + * <p>Bipartite interface is different from {@link Graph} interface, so to apply
algorithms that work on a regular graph
    + * a bipartite graph should be first converted into a {@link Graph} instance. This can
be achieved by using
    + * {@link BipartiteGraph#projectionTopSimple()} or
    --- End diff --
    Are there not four methods? Can we simply reference these, i.e. "This can be achieved
using the projection methods."?

> Add Bipartite Graph Support for Gelly
> -------------------------------------
>                 Key: FLINK-2254
>                 URL: https://issues.apache.org/jira/browse/FLINK-2254
>             Project: Flink
>          Issue Type: New Feature
>          Components: Gelly
>    Affects Versions: 0.10.0
>            Reporter: Andra Lungu
>            Assignee: Ivan Mushketyk
>              Labels: requires-design-doc
> A bipartite graph is a graph for which the set of vertices can be divided into two disjoint
sets such that each edge having a source vertex in the first set, will have a target vertex
in the second set. We would like to support efficient operations for this type of graphs along
with a set of metrics(http://jponnela.com/web_documents/twomode.pdf). 

This message was sent by Atlassian JIRA

View raw message