hama-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Apache Wiki <wikidi...@apache.org>
Subject [Hama Wiki] Trivial Update of "GraphAndMatrices" by udanax
Date Thu, 06 Nov 2008 13:57:31 GMT
Dear Wiki user,

You have subscribed to a wiki page or wiki category on "Hama Wiki" for change notification.

The following page has been changed by udanax:
http://wiki.apache.org/hama/GraphAndMatrices

------------------------------------------------------------------------------
   * Reflexive vs Non-Reflexive	
    * Reflexive graphs allow self-loops. That is, a node can have a tie to itself. This is
mostly useful when the nodes are collectivities. For example, if the nodes are cities and
the ties represent phonecalls between people living in those cities, it is possible (a virtual
certainty) that there will be ties from a city to itself.
   * Multi-graphs	
-   * If more than one edge connects two vertices, this is a multigraph. In general, we do
not use multigraphs, preferring to use either valued graphs (to represent the number of interactions
between A and B) or wholly separate graphs (to represent substantively different relations,
such as "does business with" and "is married to"
+   * If more than one edge connects two vertices, this is a multigraph. In general, we do
not use multigraphs, preferring to use either valued graphs (to represent the number of interactions
between ''A'' and ''B'') or wholly separate graphs (to represent substantively different relations,
such as "does business with" and "is married to"
  
  == Matrices ==
  We can record who is connected to whom on a given social relation via an adjacency matrix.
The adjacency matrix is a square, 1-mode matrix like this:

Mime
View raw message