You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@giraph.apache.org by "Sean Choi (JIRA)" <ji...@apache.org> on 2012/08/09 00:57:21 UTC
[jira] [Created] (GIRAPH-295) Additional Example Algorithm to
compute Outdegree and Indegree
Sean Choi created GIRAPH-295:
--------------------------------
Summary: Additional Example Algorithm to compute Outdegree and Indegree
Key: GIRAPH-295
URL: https://issues.apache.org/jira/browse/GIRAPH-295
Project: Giraph
Issue Type: Improvement
Components: examples
Affects Versions: 0.2.0
Reporter: Sean Choi
Assignee: Sean Choi
Priority: Trivial
Fix For: 0.2.0
Added a simple example to compute the indegree and outdegree of each vertex of the graph.
This should come handy for people doing analysis on the graphs.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
[jira] [Commented] (GIRAPH-295) Additional Example Algorithm to
compute Outdegree and Indegree
Posted by "Eli Reisman (JIRA)" <ji...@apache.org>.
[ https://issues.apache.org/jira/browse/GIRAPH-295?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13431495#comment-13431495 ]
Eli Reisman commented on GIRAPH-295:
------------------------------------
nice! the comment for in-degree vertex says its also for out degree.
Also...would you be interested in adding an aggregator to collect total counts from the whole graph, or is the idea to test the degree distribution just for things like our wonderful new Kroenecker graph generator?
Does anyone object to this joining our list of algorithms? One useful mod I could think of for the in-degrees would be to send the messages in superstep 0 (as you already do) and set the vertex value as the # of in-degrees (as you already do) if its is above a command-line config'ed value, or set vertex value to some sentinel like 0 or -1 otherwise. This would be nice for finding out in a given sample graph who the super nodes are, or alternately who has one a couple connections. Useful for stripping large social graphs before the "real" processing cycle.
Not sure if that would warrant its own JIRA, but you're practically there already so I thought I would mention.
Great idea, +1 here for sure.
> Additional Example Algorithm to compute Outdegree and Indegree
> ---------------------------------------------------------------
>
> Key: GIRAPH-295
> URL: https://issues.apache.org/jira/browse/GIRAPH-295
> Project: Giraph
> Issue Type: Improvement
> Components: examples
> Affects Versions: 0.2.0
> Reporter: Sean Choi
> Assignee: Sean Choi
> Priority: Trivial
> Fix For: 0.2.0
>
> Attachments: GIRAPH-295.patch
>
> Original Estimate: 0h
> Remaining Estimate: 0h
>
> Added a simple example to compute the indegree and outdegree of each vertex of the graph.
> This should come handy for people doing analysis on the graphs.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
[jira] [Commented] (GIRAPH-295) Additional Example Algorithm to
compute Outdegree and Indegree
Posted by "Hudson (JIRA)" <ji...@apache.org>.
[ https://issues.apache.org/jira/browse/GIRAPH-295?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13437649#comment-13437649 ]
Hudson commented on GIRAPH-295:
-------------------------------
Integrated in Giraph-trunk-Commit #180 (See [https://builds.apache.org/job/Giraph-trunk-Commit/180/])
GIRAPH-295: Additional Example Algorithm to compute Outdegree and
Indegree. (Sean Choi via aching) (Revision 1374906)
Result = SUCCESS
aching : http://svn.apache.org/viewcvs.cgi/?root=Apache-SVN&view=rev&rev=1374906
Files :
* /giraph/trunk/CHANGELOG
* /giraph/trunk/src/main/java/org/apache/giraph/examples/SimpleInDegreeCountVertex.java
* /giraph/trunk/src/main/java/org/apache/giraph/examples/SimpleOutDegreeCountVertex.java
> Additional Example Algorithm to compute Outdegree and Indegree
> ---------------------------------------------------------------
>
> Key: GIRAPH-295
> URL: https://issues.apache.org/jira/browse/GIRAPH-295
> Project: Giraph
> Issue Type: New Feature
> Components: examples
> Affects Versions: 0.2.0
> Reporter: Sean Choi
> Assignee: Sean Choi
> Priority: Minor
> Fix For: 0.2.0
>
> Attachments: GIRAPH-295.patch
>
> Original Estimate: 0h
> Remaining Estimate: 0h
>
> Added a simple example to compute the indegree and outdegree of each vertex of the graph.
> This should come handy for people doing analysis on the graphs.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
[jira] [Updated] (GIRAPH-295) Additional Example Algorithm to
compute Outdegree and Indegree
Posted by "Sean Choi (JIRA)" <ji...@apache.org>.
[ https://issues.apache.org/jira/browse/GIRAPH-295?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Sean Choi updated GIRAPH-295:
-----------------------------
Attachment: GIRAPH-295.patch
> Additional Example Algorithm to compute Outdegree and Indegree
> ---------------------------------------------------------------
>
> Key: GIRAPH-295
> URL: https://issues.apache.org/jira/browse/GIRAPH-295
> Project: Giraph
> Issue Type: Improvement
> Components: examples
> Affects Versions: 0.2.0
> Reporter: Sean Choi
> Assignee: Sean Choi
> Priority: Trivial
> Fix For: 0.2.0
>
> Attachments: GIRAPH-295.patch
>
> Original Estimate: 0h
> Remaining Estimate: 0h
>
> Added a simple example to compute the indegree and outdegree of each vertex of the graph.
> This should come handy for people doing analysis on the graphs.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
[jira] [Updated] (GIRAPH-295) Additional Example Algorithm to
compute Outdegree and Indegree
Posted by "Sean Choi (JIRA)" <ji...@apache.org>.
[ https://issues.apache.org/jira/browse/GIRAPH-295?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Sean Choi updated GIRAPH-295:
-----------------------------
Priority: Minor (was: Trivial)
Issue Type: New Feature (was: Improvement)
> Additional Example Algorithm to compute Outdegree and Indegree
> ---------------------------------------------------------------
>
> Key: GIRAPH-295
> URL: https://issues.apache.org/jira/browse/GIRAPH-295
> Project: Giraph
> Issue Type: New Feature
> Components: examples
> Affects Versions: 0.2.0
> Reporter: Sean Choi
> Assignee: Sean Choi
> Priority: Minor
> Fix For: 0.2.0
>
> Attachments: GIRAPH-295.patch
>
> Original Estimate: 0h
> Remaining Estimate: 0h
>
> Added a simple example to compute the indegree and outdegree of each vertex of the graph.
> This should come handy for people doing analysis on the graphs.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira