Displaying 6 results from an estimated 6 matches for "adjlist".
Did you mean:
addlist
2008 Jun 26
1
Compilation error during package installation
...g.status: creating src/config.h
config.status: creating R/config.R
config.status: creating src/Makevars
** libs
gcc -std=gnu99 -I/usr/lib/R/include -I/usr/local/include -DUSING_R
-I. -g -O2 -DPACKAGE_VERSION=\"0.5\" -DINTERNAL_ARPACK
-DINTERNAL_LAPACK -DINTERNAL_BLAS -fpic -g -O2 -c adjlist.c -o
adjlist.o
igraph.h:435: warning: inline function ?igraph_es_type? declared but
never defined
igraph.h:233: warning: inline function ?igraph_vs_type? declared but
never defined
igraph.h:435: warning: inline function ?igraph_es_type? declared but
never defined
igraph.h:233: warning: inline funct...
2008 Sep 14
3
Please help me in Converting this from C# to R
Random r = new Random();
DirectedGraph<SimpleNode> graph = GetGraph();
decimal B = 0.1m;
decimal D = 0.05m;
int nodes = graph.NodesCount;
decimal[] E = new decimal[nodes];
decimal[] P = new decimal[nodes];
for (int i = 7; i <= 10; ++i)
P[i] =
2009 Sep 08
1
Point patterns and igraph
Hi,
I have a data set consisting of the x and y coordinate locations of 1600
points. I would like to generate a graph using the functions in igraph.
However the graph making functions in igraph requires the data to be in the
form of an adjacency matrix. I'd like some advice on how to convert my point
pattern to an adjacency matrix or functions out there that would do it
directly. I've
2012 Jul 24
1
igraph build problems
...IS working for
all other users of the compiler).
I started up R and ran: install.packages("igraph"). It compiled for a
good long while (including many gfortran compile calls), and
eventually ended with:
++ -shared -o igraph.so DensityGrid.o DensityGrid_3d.o NetDataTypes.o
NetRoutines.o adjlist.o amd_1.o amd_2.o amd_aat.o amd_control.o
amd_defaults.o amd_dump.o amd_info.o amd_order.o amd_post_tree.o
amd_postorder.o amd_preprocess.o amd_valid.o arpack.o array.o atlas.o
attributes.o basic_query.o bfgs.o bigint.o bignum.o bipartite.o blas.o
bliss.o bliss_eqrefhash.o bliss_graph.o bliss_heap....
2009 Apr 18
0
igraph 0.5.2
...functions to/from graphNEL objects (graph package),
see ?igraph.to.graphNEL and ?igraph.from.graphNEL.
- Conversion functions to/from sparse matrices (Matrix package),
see ?graph.adjacency and the 'sparse' argument of
?get.adjacency.
- Creating graphs from adjacency lists, see ?graph.adjlist.
- The function graph.data.frame has an argument called
'vertices' and this makes it very easy to create graphs
with a lot of vertex and edge metadata.
- The Dijkstra and Bellman-Ford shortest path algorithms
were added, see ?shortest.paths.
- The function is.mutual() was added, this...
2009 Apr 18
0
igraph 0.5.2
...functions to/from graphNEL objects (graph package),
see ?igraph.to.graphNEL and ?igraph.from.graphNEL.
- Conversion functions to/from sparse matrices (Matrix package),
see ?graph.adjacency and the 'sparse' argument of
?get.adjacency.
- Creating graphs from adjacency lists, see ?graph.adjlist.
- The function graph.data.frame has an argument called
'vertices' and this makes it very easy to create graphs
with a lot of vertex and edge metadata.
- The Dijkstra and Bellman-Ford shortest path algorithms
were added, see ?shortest.paths.
- The function is.mutual() was added, this...