| |
by: _mario.lat |
last post by:
kruskal:minimum spanning tree. how to do?
I'd like to find the minimum spanning tree with kruskal algorithm.
There is a code (in C++) written?
which contenitor do you suggest (Vector, set, ...)?
How can I do?
Thank you in advance, Mario.
|
by: pillepop2003 |
last post by:
Hey!
Can anyone give me a hint, how this problem is best implemented:
I have a table of users (see below), where every user has one
"superior user" (= parent node), this should be a fully unambigous
tree structure. The root node can have whatever value you prefer, I
suppose NULL would be good for a start. What I want to do is finding
the way from an arbitrary node in the tree.
Example:
|
by: --CELKO-- |
last post by:
I am re-doing the graphs section for the third edition of SQL FOR
SMARTIES and would like some feedback and help.
Here is a version of Floyd's algorithm to find the transitive closure
of a graph. You can also look up Warshall's algorithm, which is an
earlier and more specialized version of Floyd's algorithm. Given a
directed graph G represented by an adjacency matrix A, WHERE
A = 1 if the edge (i, j) is in the graph, compute the matrix...
|
by: Gregor Rot |
last post by:
Hi,
i am interested in the fastest possible representation of an undirected
graph G=(V,E) (vertex, edge representation) in connection with the
Kruskal's algorithm (finding a minimal spanning tree)...anyway, what's
the best way to represent a graph in c (talking about data structures)?
tnx,
Greg
|
by: Tamir Khason |
last post by:
I have parent-child hashtable with more then 900K items and I have to build
all pathes for this. E.G
Key ParentKey
1 0
2 1
3 2
4 8
5 3
6 1
7 3
|
| |
by: enigma261 |
last post by:
Hello,
I am looking for graph layout algorithms.
I am representing a process flow using a graph.
I have the visual representation of nodes and connectors.
I would like to use a graph layout algorithm to represent this
graph.
Pointers to such algorithms (freeware or paid) will be appreciated.
|
by: prometheuzz |
last post by:
Hello (Java) enthusiasts,
In this article I’d like to tell you a little bit about graphs and how you can
search a graph using the BFS (breadth first search) algorithm.
I’ll address, and hopefully answer, the following questions:
• what is a graph?
• how can a graph be represented as an ADT?
• how can we search/walk through a graph using the BFS algorithm?
|
by: Kenneth Porter |
last post by:
I have a sorted vector of structs, each containing a upper limit of a
range:
struct Datum
{
double upper_limit;
// other stuff
};
std::vector<Datumdata;
|
by: Tsuk |
last post by:
I am making a tipover solver in C.
I'm trying to solve it by creating a tree with all the possible paths and then process all the tree with a level search algorithm, looking for the shortest path. This implementation is pretty easy to do but takes more processing time than I was expecting. So now I'm thinking about do it with a variation of the A* algorithm. Do you think it will run faster? Or the problem is in looking to all the possible...
|
by: marktang |
last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However, people are often confused as to whether an ONU can Work As a Router. In this blog post, we’ll explore What is ONU, What Is Router, ONU & Router’s main usage, and What is the difference between ONU and Router. Let’s take a closer look !
Part I. Meaning of...
|
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can effortlessly switch the default language on Windows 10 without reinstalling. I'll walk you through it.
First, let's disable language synchronization. With a Microsoft account, language settings sync across devices. To prevent any complications,...
|
| |
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers, it seems that the internal comparison operator "<=>" tries to promote arguments from unsigned to signed.
This is as boiled down as I can make it.
Here is my compilation command:
g++-12 -std=c++20 -Wnarrowing bit_field.cpp
Here is the code in...
|
by: tracyyun |
last post by:
Dear forum friends,
With the development of smart home technology, a variety of wireless communication protocols have appeared on the market, such as Zigbee, Z-Wave, Wi-Fi, Bluetooth, etc. Each protocol has its own unique characteristics and advantages, but as a user who is planning to build a smart home system, I am a bit confused by the choice of these technologies. I'm particularly interested in Zigbee because I've heard it does some...
|
by: agi2029 |
last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development project—planning, coding, testing, and deployment—without human intervention. Imagine an AI that can take a project description, break it down, write the code, debug it, and then launch it, all on its own....
Now, this would greatly impact the work of software developers. The idea...
|
by: isladogs |
last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM).
In this session, we are pleased to welcome a new presenter, Adolph Dupré who will be discussing some powerful techniques for using class modules.
He will explain when you may want to use classes instead of User Defined Types (UDT). For example, to manage the data in unbound forms.
Adolph will...
|
by: conductexam |
last post by:
I have .net C# application in which I am extracting data from word file and save it in database particularly. To store word all data as it is I am converting the whole word file firstly in HTML and then checking html paragraph one by one.
At the time of converting from word file to html my equations which are in the word document file was convert into image.
Globals.ThisAddIn.Application.ActiveDocument.Select();...
|
by: adsilva |
last post by:
A Windows Forms form does not have the event Unload, like VB6. What one acts like?
|
| |
by: bsmnconsultancy |
last post by:
In today's digital era, a well-designed website is crucial for businesses looking to succeed. Whether you're a small business owner or a large corporation in Toronto, having a strong online presence can significantly impact your brand's success. BSMN Consultancy, a leader in Website Development in Toronto offers valuable insights into creating effective websites that not only look great but also perform exceptionally well. In this comprehensive...
|
1
