I am using CVSWeb on HPUnix.
When i access it, all directories are listed but files are not listed.
I am getting the error "NOTE: There are 51 files, but none matches the current tag. "
in tomcat sevrer log i am getting the message "rlog warning: Missing revision or branch number after -r"... (0 Replies)
hi,
i am very- very new to unix
i have os - sun solaris 5.9 and i want to learn more about system attributes for example, the make - model of machine , operating system & patch versions
can somebody tell me a usefull command to learn these?
any help would be apreciated,
regards to all,... (3 Replies)
I got a server (test server) that hangs anytime we run a ls attribute like ls -ltr or ls -al. We can run ls | more command with no problem. But getting back to the ls attribute problem, it just sits and hangs, I did a ps -ef | grep ls, and a user had 15 sessions of ls -al running, I killed those,... (3 Replies)
i have a file with contents
test123
qwwww
sdsad
asdasd
asdad
adadsw
sasfar
sfaf
a
afasf
OPERATION END
i need to grep all the contents from test123 and OPERATION END.Can somebody help me how to do it ? (7 Replies)
Hi,
I would like to know if there is a command similar to scsimgr in HP-UX that
can help me change the algorithm and reserve_policy attributes of all luns presented to an AIX host.
Otherwise I would have to use,
chdev -l hdiskX -a algorithm=round_robin reserve_policy=no_reserve
in a... (1 Reply)
Hi Gurus,
I am trying to create a FS using SVM but system is throwing the following error.
newfs /dev/md/rdsk/d1002
newfs: construct a new file system /dev/md/rdsk/d1002: (y/n)? y
/usr/sbin/clri: can't get execution attributes (1 Reply)
I'm trying to sort out the charing of a problem folder, in the 'ls -l' list is shows as:
d???????????? ? ? ? ? ? Pi-Share
PiShare is the name of the directory, all the ??s make no sense to me at all, and no user (there are only two, pi and root) can make any changes to it.... (4 Replies)
Discussion started by: MuntyScrunt
4 Replies
LEARN ABOUT DEBIAN
graph::adjacencymatrix
Graph::AdjacencyMatrix(3pm) User Contributed Perl Documentation Graph::AdjacencyMatrix(3pm)NAME
Graph::AdjacencyMatrix - create and query the adjacency matrix of graph G
SYNOPSIS
use Graph::AdjacencyMatrix;
use Graph::Directed; # or Undirected
my $g = Graph::Directed->new;
$g->add_...(); # build $g
my $am = Graph::AdjacencyMatrix->new($g);
$am->is_adjacent($u, $v)
my $am = Graph::AdjacencyMatrix->new($g, distance_matrix => 1);
$am->distance($u, $v)
my $am = Graph::AdjacencyMatrix->new($g, attribute_name => 'length');
$am->distance($u, $v)
my $am = Graph::AdjacencyMatrix->new($g, ...);
my @V = $am->vertices();
DESCRIPTION
You can use "Graph::AdjacencyMatrix" to compute the adjacency matrix and optionally also the distance matrix of a graph, and after that
query the adjacencyness between vertices by using the "is_adjacent()" method, or query the distance between vertices by using the
"distance()" method.
By default the edge attribute used for distance is "w", but you can change that in new(), see below.
If you modify the graph after creating the adjacency matrix of it, the adjacency matrix and the distance matrix may become invalid.
Methods
Class Methods
new($g)
Construct the adjacency matrix of the graph $g.
new($g, options)
Construct the adjacency matrix of the graph $g with options as a hash. The known options are
distance_matrix => boolean
By default only the adjacency matrix is computed. To compute also the distance matrix, use the attribute "distance_matrix"
with a true value to the new() constructor.
attribute_name => attribute_name
By default the edge attribute used for distance is "w". You can change that by giving another attribute name with the
"attribute_name" attribute to new() constructor. Using this attribute also implicitly causes the distance matrix to be
computed.
Object Methods
is_adjacent($u, $v)
Return true if the vertex $v is adjacent to vertex $u, or false if not.
distance($u, $v)
Return the distance between the vertices $u and $v, or "undef" if the vertices are not adjacent.
adjacency_matrix
Return the adjacency matrix itself (a list of bitvector scalars).
vertices
Return the list of vertices (useful for indexing the adjacency matrix).
ALGORITHM
The algorithm used to create the matrix is two nested loops, which is O(V**2) in time, and the returned matrices are O(V**2) in space.
SEE ALSO
Graph::TransitiveClosure, Graph::BitMatrix
AUTHOR AND COPYRIGHT
Jarkko Hietaniemi jhi@iki.fi
LICENSE
This module is licensed under the same terms as Perl itself.
perl v5.10.0 2005-04-16 Graph::AdjacencyMatrix(3pm)